Author of the publication

Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees.

, and . FSTTCS, volume 2914 of Lecture Notes in Computer Science, page 289-301. Springer, (2003)

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

Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem., , , and . SODA, page 619-628. ACM/SIAM, (1997)Sort-Cut: A Pareto Optimal and Semi-Truthful Mechanism for Multi-Unit Auctions with Budget-Constrained Bidders, , and . CoRR, (2009)A near Pareto optimal auction with budget constraints., , and . Games Econ. Behav., 74 (2): 699-708 (2012)Approximation Algorithms for Multicommodity Facility Location Problems., and . SIAM J. Discret. Math., 24 (2): 538-551 (2010)Line-of-Sight Networks., , , and . Comb. Probab. Comput., 18 (1-2): 145-163 (2009)We know who you followed last summer: inferring social link creation times in twitter., , , , , and . WWW, page 517-526. ACM, (2011)A new system-wide diversity measure for recommendations with efficient algorithms., , and . CoRR, (2018)Inventory Routing Problem with Facility Location., and . WADS, volume 11646 of Lecture Notes in Computer Science, page 452-465. Springer, (2019)On Two-Stage Stochastic Minimum Spanning Trees., , and . IPCO, volume 3509 of Lecture Notes in Computer Science, page 321-334. Springer, (2005)Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs., and . ICALP (1), volume 4051 of Lecture Notes in Computer Science, page 169-180. Springer, (2006)