Author of the publication

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

Greedy algorithm for stochastic matching is a 2-approximation. CoRR, (2010)An O(loglog n)-Approximation for Submodular Facility Location., , , , , , and . CoRR, (2022)Submodular Stochastic Probing on Matroids., , and . STACS, volume 25 of LIPIcs, page 29-40. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Multi-dimensional mechanism design via random order contention resolution schemes., and . SIGecom Exch., 17 (2): 46-53 (2019)Improved Approximation Algorithms for Stochastic-Matching Problems., , , , , and . CoRR, (2020)Improved Approximation Algorithms for Stochastic Matching., , and . ESA, volume 9294 of Lecture Notes in Computer Science, page 1-12. Springer, (2015)Sequential Posted Price Mechanisms with Correlated Valuations., , , , and . WINE, volume 9470 of Lecture Notes in Computer Science, page 1-15. Springer, (2015)When the Optimum is also Blind: a New Perspective on Universal Optimization., , , and . ICALP, volume 80 of LIPIcs, page 35:1-35:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Improved analysis of the greedy algorithm for stochastic matching.. Inf. Process. Lett., 111 (15): 731-737 (2011)Submodular Stochastic Probing on Matroids., , and . CoRR, (2013)