Author of the publication

Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems.

, , and . STACS, volume 3884 of Lecture Notes in Computer Science, page 206-217. 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

We know who you followed last summer: inferring social link creation times in twitter., , , , , and . WWW, page 517-526. ACM, (2011)Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem., , , and . SODA, page 619-628. ACM/SIAM, (1997)A new system-wide diversity measure for recommendations with efficient algorithms., , and . CoRR, (2018)Sort-Cut: A Pareto Optimal and Semi-Truthful Mechanism for Multi-Unit Auctions with Budget-Constrained Bidders, , and . CoRR, (2009)Approximation Through Local Optimality: Designing Networks with Small Degree., , and . FSTTCS, volume 652 of Lecture Notes in Computer Science, page 279-290. Springer, (1992)Randomized Approximation Algorithms for Query Optimization Problems on Two Processors., , and . ESA, volume 2461 of Lecture Notes in Computer Science, page 649-661. Springer, (2002)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)Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design., , and . SIAM J. Comput., 44 (5): 1202-1229 (2015)Optimal Circuits for Parallel Multipliers., , , and . IEEE Trans. Computers, 47 (3): 273-285 (1998)