Go to DBLP homepageA 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One
Abstract: We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one.
Loading
OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2026 OpenReview