Short Tours through Large Linear Forests

DOI10.1007/978-3-319-07557-0_23zbMath1418.90274OpenAlexW2158014777MaRDI QIDQ5419002

Mohit Singh, R. Ravi, Uriel Feige

Publication date: 2 June 2014

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07557-0_23

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (6)

A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs ⋮ On the path partition number of 6‐regular graphs ⋮ Unnamed Item ⋮ On an \(f\)-coloring generalization of linear arboricity of multigraphs ⋮ Towards the linear arboricity conjecture ⋮ Unnamed Item

This page was built for publication: Short Tours through Large Linear Forests