Author of the publication

Tight approximation bounds for combinatorial frugal coverage algorithms.

, , and . J. Comb. Optim., 26 (2): 292-309 (2013)

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

Efficient on-line communication in cellular networks., , and . SPAA, page 46-53. ACM, (2000)Optimal social choice functions: a utilitarian view., , , , , and . EC, page 197-214. ACM, (2012)Revenue Guarantees in the Generalized Second Price Auction., , , and . ACM Trans. Internet Techn., 14 (2-3): 17:1-17:19 (2014)Limitations of Deterministic Auction Design for Correlated Bidders., , and . TOCT, 8 (4): 13:1-13:18 (2016)Minority Becomes Majority in Social Networks., , , , and . WINE, volume 9470 of Lecture Notes in Computer Science, page 74-88. Springer, (2015)Tight approximation bounds for combinatorial frugal coverage algorithms., , and . J. Comb. Optim., 26 (2): 292-309 (2013)New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies., , and . SIROCCO, volume 8 of Proceedings in Informatics, page 77-88. Carleton Scientific, (2001)An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling., and . Theory Comput. Syst., 63 (1): 114-127 (2019)Tight Bounds for Selfish and Greedy Load Balancing., , , , and . Algorithmica, 61 (3): 606-637 (2011)Improved Lower Bounds on the Price of Stability of Undirected Network Design Games., , , and . Theory Comput. Syst., 52 (4): 668-686 (2013)