Author of the publication

Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs.

, , , and . J. ACM, 52 (4): 602-626 (2005)

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

Dictionary Matching.. Encyclopedia of Algorithms, (2016)Structure and Hardness in P (Dagstuhl Seminar 16451)., , and . Dagstuhl Reports, 6 (11): 1-34 (2016)Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing., , , , , and . CoRR, (2013)Dynamic text and static pattern matching., , , and . ACM Trans. Algorithms, 3 (2): 19 (2007)Approximate parameterized matching., , and . ACM Trans. Algorithms, 3 (3): 29 (2007)An improved upper bound for the TSP in cubic 3-edge-connected graphs, , and . Operations Research Letters, 33 (5): 467--474 (2005)A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP., and . SIAM J. Discret. Math., 17 (2): 237-248 (2003)Less Space: Indexing for Queries with Wildcards., , , and . ISAAC, volume 8283 of Lecture Notes in Computer Science, page 89-99. Springer, (2013)LCP Magic.. CPM, volume 7922 of Lecture Notes in Computer Science, page 11. Springer, (2013)Generalized Substring Compression., , , and . CPM, volume 5577 of Lecture Notes in Computer Science, page 26-38. Springer, (2009)