From post

Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs.

, , и . FCT, том 4639 из Lecture Notes in Computer Science, стр. 52-63. Springer, (2007)

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.

 

Другие публикации лиц с тем же именем

An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling., и . Theory Comput. Syst., 63 (1): 114-127 (2019)Sparse and limited wavelength conversion in all-optical tree networks., , , , и . Theor. Comput. Sci., 266 (1-2): 887-934 (2001)Efficient on-line communication in cellular networks., , и . SPAA, стр. 46-53. ACM, (2000)New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies., , и . SIROCCO, том 8 из Proceedings in Informatics, стр. 77-88. Carleton Scientific, (2001)Limitations of Deterministic Auction Design for Correlated Bidders., , и . TOCT, 8 (4): 13:1-13:18 (2016)Optimal social choice functions: a utilitarian view., , , , , и . EC, стр. 197-214. ACM, (2012)Energy-Efficient Wireless Network Design., , и . ISAAC, том 2906 из Lecture Notes in Computer Science, стр. 585-594. Springer, (2003)Optimizing over Serial Dictatorships., и . SAGT, том 14238 из Lecture Notes in Computer Science, стр. 329-346. Springer, (2023)Impartial Selection with Additive Approximation Guarantees., , и . SAGT, том 11801 из Lecture Notes in Computer Science, стр. 269-283. Springer, (2019)Efficiency and Complexity of Price Competition Among Single-Product Vendors., , , , , и . IJCAI, стр. 25-31. AAAI Press, (2015)