Author of the publication

On Hardness of Pricing Items for Single-Minded Bidders.

, , , and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 202-216. Springer, (2009)

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

Improved approximation for universal facility location., , and . SODA, page 959-960. SIAM, (2005)Scheduling with Setup Costs and Monotone Penalties., , , and . FSTTCS, volume 18 of LIPIcs, page 185-198. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Real-time scheduling to minimize machine busy times., , , and . J. Sched., 18 (6): 561-573 (2015)Stateless distributed algorithms for near optimal maximum multicommodity flows., and . PODC, page 440. ACM, (2008)Greedy distributed optimization of multi-commodity flows., and . PODC, page 274-283. ACM, (2007)Two-Stage Robust Network Design with Exponential Scenarios., , , and . ESA, volume 5193 of Lecture Notes in Computer Science, page 589-600. Springer, (2008)Advantage of Overlapping Clusters for Minimizing Conductance., , and . LATIN, volume 7256 of Lecture Notes in Computer Science, page 494-505. Springer, (2012)A Simple and Efficient Algorithm for Computing Market Equilibria., , , , and . ACM Trans. Algorithms, 12 (3): 34:1-34:15 (2016)The checkpoint problem., , , and . Theor. Comput. Sci., (2012)Approximating fault-tolerant group-Steiner problems., , and . Theor. Comput. Sci., (2012)