Degree Bounded Matroids and Submodular Flows

DOI10.1007/978-3-540-68891-4_18MaRDI QIDQ3503852zbMATH OpenOpenAlexFDO

Authors Tamás Király, Lap Chi Lau, Mohit Singh

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Generalized polymatroids and submodular flows
• scientific article; zbMATH DE number 1101952
• scientific article; zbMATH DE number 1953186
• Simple push-relabel algorithms for matroids and submodular flows
• A decomposition of the matroids with the max-flow min-cut property
• Lattice polyhedra and submodular flows
• A survey on flows in graphs and matroids
• scientific article; zbMATH DE number 1146228
• A generalized cut-condition for multiflows in matroids

Cited in

(9)

• A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
• Degree bounded matroids and submodular flows
• Packing Steiner trees
• Degree bounded forest covering
• Network Design with Weighted Degree Constraints
• Network design with weighted degree constraints
• Approximating bounded degree deletion via matroid matching
• Matroidal degree-bounded minimum spanning trees
• A unified algorithm for degree bounded survivable network design

This page was built for publication: Degree Bounded Matroids and Submodular Flows

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