Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer_journal/maximum-atsp-with-weights-zero-and-one-via-half-edges-5eqUEfyySU
References (22)
-
M. Bläser, B. Manthey (2001)
Computing Cycle Covers without Short Cycles -
Katarzyna Paluch, Khaled Elbassioni, A. Zuylen (2012)
Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem -
Lukasz Kowalik, M. Mucha (2007)
35/44-approximation for Asymmetric Maximum TSP with Triangle InequalityAlgorithmica, 59
-
Katarzyna Paluch, M. Mucha, A. Madry (2008)
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem -
Moshe Lewenstein, M. Sviridenko (2004)
A 5/8 Approximation Algorithm for the Maximum Asymmetric TSPSIAM J. Discret. Math., 17
-
C. Papadimitriou, M. Yannakakis (1993)
The Traveling Salesman Problem with Distances One and TwoMath. Oper. Res., 18
-
S. Vishwanathan (1992)
An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and TwoInf. Process. Lett., 44
-
H Kaplan, M Lewenstein, N Shafrir, M Sviridenko (2005)
Approximation algorithms for asymmetric tsp by decomposing directed regular multigraphsJ. ACM, 52
-
Lukasz Kowalik, M. Mucha (2008)
Deterministic 7/8-approximation for the metric maximum TSP -
S. Kosaraju, James Park, C. Stein (1994)
Long Tours and Short Superstrings (Preliminary Version) -
Katarzyna Paluch (2014)
Better Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest SuperstringArXiv, abs/1401.3670
-
S. Micali, V. Vazirani (1980)
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
-
M. Bläser (2002)
An 8/13-approximation algorithm for the asymmetric maximum TSPJ. Algorithms, 50
-
S. Kosaraju, James Park, C. Stein (1994)
Long tours and short superstringsProceedings 35th Annual Symposium on Foundations of Computer Science
-
M. Bläser (2004)
A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One -
Marek Karpinski, R. Schmied (2013)
Improved Inapproximability Results for the Shortest Superstring and Related Problems -
M. Fisher, G. Nemhauser, L. Wolsey (1979)
An Analysis of Approximations for Finding a Maximum Weight Hamiltonian CircuitOper. Res., 27
-
Jane Zundel (2019)
MATCHING THEORY -
(ii) for each M -hit 2 -cycle of G 1 connecting vertices u and v ˜ C contains either zero or two edges from { ( u, x ( u,v ) ) , ( x ( u,v ) , v ) , ( v, x ( v,u ) ) , ( x ( v,u ) , u ) } -
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, M. Sviridenko (2003)
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
-
M. Bläser, B. Manthey (2002)
Two Approximation Algorithms for 3-Cycle Covers -
(2015)
Maximum ATSP with weights zero and one via half-edges
- Publisher
- Springer Journals
- Copyright
- Copyright © 2017 by Springer Science+Business Media, LLC
- Subject
- Computer Science; Theory of Computation
- ISSN
- 1432-4350
- eISSN
- 1433-0490
- DOI
- 10.1007/s00224-017-9818-1
- Publisher site
- See Article on Publisher Site
Abstract
We present a fast combinatorial 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. The approximation factor of this algorithm matches the currently best one given by Bläser in 2004 and based on linear programming. Our algorithm first computes a maximum size matching and a maximum weight cycle cover without certain cycles of length two but possibly with half-edges - a half-edge of a given edge e is informally speaking a half of e that contains one of the endpoints of e. Then from the computed matching and cycle cover it extracts a set of paths, whose weight is large enough to be able to construct a traveling salesman tour with the claimed guarantee.
Journal
Theory of Computing Systems – Springer Journals
Published: Nov 4, 2017