Short Tours through Large Linear Forests

DOI10.1007/978-3-319-07557-0_23MaRDI QIDQ5419002zbMATH OpenOpenAlexFDO

Authors R. Ravi, Mohit Singh, 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

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

Recommendations

• Long cycles through a linear forest
• Long cycles passing through a linear forest
• Local Linear Forests
• Walks and paths in trees
• Perfect distance forests
• Finding paths through narrow and wide trees
• Dense forests constructed from grids
• scientific article; zbMATH DE number 566078
• Coherent forests
• Forests on wired regular trees

Cited in

(6)

• Towards the linear arboricity conjecture
• A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs
• Max-min greedy matching
• scientific article; zbMATH DE number 7650074 (Why is no real title available?)
• On the path partition number of 6‐regular graphs
• On an f-coloring generalization of linear arboricity of multigraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419002)