49 citations · 71 across the 10 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014
Maximum ATSP with Weights Zero and One via Half-Edges
Katarzyna Paluch
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 curre…
cs.DS2014★ 18 cited
Better Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring
Katarzyna Paluch
In the maximum asymmetric traveling salesman problem (Max ATSP) we are given a complete directed graph with nonnegative weights on the edges and we wish to compute a traveling sale…