k-Trails: Recognition, Complexity, and Approximations

DOI10.1007/978-3-319-33461-5_10zbMath1419.90097arXiv1512.01781OpenAlexW2256715486MaRDI QIDQ3186496

Rico Zenklusen, Mohit Singh

Publication date: 10 August 2016

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

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

Mathematics Subject Classification ID

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

Cites Work

• On generalizations of network design problems with degree bounds
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Iterative Methods in Combinatorial Optimization
• Approximating minimum bounded degree spanning trees to within one of optimal
• Additive Guarantees for Degree-Bounded Directed Network Design
• Rado's theorem for polymatroids
• Approximation of the Degree-Constrained Minimum Spanning Hierarchies

This page was built for publication: k-Trails: Recognition, Complexity, and Approximations