Author of the publication

Approximation of Partial Capacitated Vertex Cover.

, , , and . ESA, volume 4698 of Lecture Notes in Computer Science, page 335-346. Springer, (2007)

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

The Ad Types Problem., , , and . WINE, volume 12495 of Lecture Notes in Computer Science, page 45-58. Springer, (2020)Turbocharging Treewidth Heuristics., , , , and . IPEC, volume 63 of LIPIcs, page 13:1-13:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Greedy in Approximation Algorithms.. ESA, volume 4168 of Lecture Notes in Computer Science, page 528-539. Springer, (2006)An Optimal Incremental Algorithm for Minimizing Lateness with Rejection., and . ESA, volume 5193 of Lecture Notes in Computer Science, page 601-610. Springer, (2008)Parametric Packing of Selfish Items and the Subset Sum Algorithm., , and . WINE, volume 5929 of Lecture Notes in Computer Science, page 67-78. Springer, (2009)A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses.. Algorithmica, 55 (1): 227-239 (2009)Max-Coloring Paths: Tight Bounds and Extensions., and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 87-96. Springer, (2009)Improved Approximations for Guarding 1.5-Dimensional Terrains., , , , and . Algorithmica, 60 (2): 451-463 (2011)On the Extended TSP Problem., , and . ISAAC, volume 212 of LIPIcs, page 42:1-42:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Combinatorial Algorithms for Data Migration to Minimize Average Completion Time., and . APPROX-RANDOM, volume 4110 of Lecture Notes in Computer Science, page 128-139. Springer, (2006)