A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One

@inproceedings{Blser2004A3A,
  title={A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One},
  author={Markus Bl{\"a}ser},
  booktitle={APPROX-RANDOM},
  year={2004}
}
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. 

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 29 CITATIONS

Maximum ATSP with Weights Zero and One via Half-Edges

VIEW 7 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Maximum ATSP with Weights Zero and One via Half-Edges

  • Theory of Computing Systems
  • 2014
VIEW 7 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

On Eulerian extensions and their application to no-wait flowshop scheduling

VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

An Introduction to Temporal Graphs: An Algorithmic Perspective

  • Algorithms, Probability, Networks, and Games
  • 2015
VIEW 1 EXCERPT
CITES BACKGROUND