\(k\)-trails: recognition, complexity, and approximations

DOI10.1007/s10107-017-1113-zzbMath1406.90107OpenAlexW2580596831MaRDI QIDQ1800995

Rico Zenklusen, Mohit Singh

Publication date: 26 October 2018

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-017-1113-z

zbMATH Keywords

matroidsapproximation algorithms\(k\)-trails

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• On generalizations of network design problems with degree bounds
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Degree bounded matroids and submodular flows
• Submodular functions and optimization.
• 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
• Approximation algorithms for degree-constrained minimum-cost network-design problems

This page was built for publication: \(k\)-trails: recognition, complexity, and approximations