Author of the publication

Centrality of Trees for Capacitated k-Center.

, , , , , and . IPCO, volume 8494 of Lecture Notes in Computer Science, page 52-63. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Approximation Algorithms for the Partition Vertex Cover Problem., , , and . WALCOM, volume 7748 of Lecture Notes in Computer Science, page 137-145. Springer, (2013)Improved Algorithms for Resource Allocation under Varying Capacity., , , , and . ESA, volume 8737 of Lecture Notes in Computer Science, page 222-234. Springer, (2014)Approximation algorithms for the partition vertex cover problem., , , and . Theor. Comput. Sci., (2014)Improved algorithms for resource allocation under varying capacity., , , , and . J. Sched., 21 (3): 313-325 (2018)Local Search Methods for k-Means with Outliers., , , , and . Proc. VLDB Endow., 10 (7): 757-768 (2017)Centrality of Trees for Capacitated k-Center., , , , , and . IPCO, volume 8494 of Lecture Notes in Computer Science, page 52-63. Springer, (2014)Approximation algorithms for clustering and facility location problems. University of Illinois Urbana-Champaign, USA, (2018)Approximation Algorithms for Edge Partitioned Vertex Cover Problems, , , and . CoRR, (2011)Perturbation Resilient Clustering for k-Center and Related Problems via LP Relaxations., and . APPROX-RANDOM, volume 116 of LIPIcs, page 9:1-9:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Fast Compaction Algorithms for NoSQL Databases., , , and . ICDCS, page 452-461. IEEE Computer Society, (2015)