Maximum ATSP with Weights Zero and One via Half-Edges
Data Structures and Algorithms
2014-08-08 v1 Discrete Mathematics
Abstract
We present a fast combinatorial -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\"aser 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 {\em half-edges} - a half-edge of a given edge is informally speaking a half of that contains one of the endpoints of . 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.
Cite
@article{arxiv.1408.1431,
title = {Maximum ATSP with Weights Zero and One via Half-Edges},
author = {Katarzyna Paluch},
journal= {arXiv preprint arXiv:1408.1431},
year = {2014}
}