Author of the publication

A Unified Approach to Approximating Partial Covering Problems.

, , and . ESA, volume 4168 of Lecture Notes in Computer Science, page 468-479. Springer, (2006)

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

Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems., and . SIAM J. Comput., 37 (2): 630-652 (2007)Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds., and . SIAM J. Comput., 34 (3): 763-773 (2005)A group-strategyproof mechanism for Steiner forests., , and . SODA, page 612-619. SIAM, (2005)Hypergraphic LP Relaxations for Steiner Trees, , and . CoRR, (2009)Stable marriage with general preferences., , and . CoRR, (2014)Social exchange networks with distant bargaining., , , and . Theor. Comput. Sci., (2014)Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time., , and . CoRR, (2018)Covering Graphs Using Trees and Stars., , , , and . RANDOM-APPROX, volume 2764 of Lecture Notes in Computer Science, page 24-35. Springer, (2003)Fast Approximation Algorithms for the Generalized Survivable Network Design Problem., , , and . ISAAC, volume 64 of LIPIcs, page 33:1-33:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances., , and . SAGT, volume 7615 of Lecture Notes in Computer Science, page 216-226. Springer, (2012)