An Improved Analysis of the Mömke-Svensson Algorithm for Graph-TSP on Subquartic Graphs

DOI10.1007/978-3-662-44777-2_61zbMath1425.68475arXiv1407.2524OpenAlexW2963220947MaRDI QIDQ2921458

Alantha Newman

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.2524

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (1)

A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs

This page was built for publication: An Improved Analysis of the Mömke-Svensson Algorithm for Graph-TSP on Subquartic Graphs