Skip to main content
Journal Article

A 3/4-approximation algorithm for maximum ATSP with weights zero and one

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3122 61-71
DOI: 10.1007/978-3-540-27821-4_6
31Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (minimum) asymmetric TSP with weights one and two and a 3/4-approximation algorithm for the Maximum Directed Path Packing Problem. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Bläser, M. (2004). A 3/4-approximation algorithm for maximum ATSP with weights zero and one. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3122, 61–71. https://doi.org/10.1007/978-3-540-27821-4_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free