Degree Bounded Matroids and Submodular Flows
From MaRDI portal
Publication:3503852
DOI10.1007/978-3-540-68891-4_18zbMath1143.90380OpenAlexW1775129636MaRDI QIDQ3503852
Mohit Singh, Lap Chi Lau, Tamás Király
Publication date: 10 June 2008
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/19505/1/kiraly_lau_singh_final.pdf
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (9)
Packing Steiner trees ⋮ Approximation-Friendly Discrepancy Rounding ⋮ On generalizations of network design problems with degree bounds ⋮ A unified algorithm for degree bounded survivable network design ⋮ Network design with weighted degree constraints ⋮ Degree Bounded Forest Covering ⋮ Network Design with Weighted Degree Constraints ⋮ A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids ⋮ Unnamed Item
This page was built for publication: Degree Bounded Matroids and Submodular Flows
