Author of the publication

A (slightly) improved approximation algorithm for metric TSP

, , and . Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, page 32--45. (2021)

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

Biased Random Walks., , , , and . Combinatorica, 16 (1): 1-18 (1996)Approaching utopia: strong truthfulness and externality-resistant mechanisms., , , and . ITCS, page 221-230. ACM, (2013)A Lower Bound on the Competitive Ratio of Truthful Auctions., , , and . STACS, volume 2996 of Lecture Notes in Computer Science, page 644-655. Springer, (2004)On List Update and Work Function Algorithms., , , , and . ESA, volume 1643 of Lecture Notes in Computer Science, page 289-300. Springer, (1999)On list update and work function algorithms., , , , and . Theor. Comput. Sci., 287 (2): 393-418 (2002)Matroid Partition Property and the Secretary Problem., , , and . CoRR, (2021)Simple Pricing Schemes For Consumers With Evolving Values., , , and . SODA, page 1476-1490. SIAM, (2016)Matroid Partition Property and the Secretary Problem., , , and . ITCS, volume 251 of LIPIcs, page 2:1-2:9. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Balanced Allocations., , , and . SIAM J. Comput., 29 (1): 180-200 (1999)On a Competitive Secretary Problem., and . AAAI, page 944-950. AAAI Press, (2015)