A 4/5 -- approximation algorithm for the maximum traveling salesman problem
From MaRDI portal
Publication:2401155
DOI10.1007/978-3-319-59250-3_15zbMath1418.90222arXiv1512.09236OpenAlexW2962800390MaRDI QIDQ2401155
Szymon Dudycz, Bartosz Rybicki, Jan Marcinkowski, Katarzyna E. Paluch
Publication date: 31 August 2017
Full work available at URL: https://arxiv.org/abs/1512.09236
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (3)
A polynomial algorithm with asymptotic ratio $2/3$ for the asymmetric maximization version of the $m$-PSP ⋮ Methods for determining cycles of a specific length in undirected graphs with edge weights ⋮ A Polynomial 3/5-Approximate Algorithm for the Asymmetric Maximization Version of the 3-PSP
This page was built for publication: A 4/5 -- approximation algorithm for the maximum traveling salesman problem
