Short Tours through Large Linear Forests
From MaRDI portal
Publication:5419002
DOI10.1007/978-3-319-07557-0_23zbMATH Open1418.90274OpenAlexW2158014777MaRDI QIDQ5419002FDOQ5419002
Uriel Feige, Mohit Singh, R. Ravi
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
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)
- A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs
- On the path partition number of 6‐regular graphs
- On an \(f\)-coloring generalization of linear arboricity of multigraphs
- Towards the linear arboricity conjecture
- Title not available (Why is that?)
- Title not available (Why is that?)
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)