A rounding technique for the polymatroid membership problem

DOI10.1016/0024-3795(93)00222-LzbMath0833.05018WikidataQ127526107 ScholiaQ127526107MaRDI QIDQ1893104

H. Narayanan

Publication date: 3 July 1995

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

polyhedronmatroidmembership problempolymatroid functions

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (2)

Comparison of three approaches to studying stability of solutions to problems of discrete optimization and computational geometry ⋮ Faster algorithms for security games on matroids

Cites Work

• Unnamed Item
• Testing membership in matroid polyhedra
• On submodular function minimization
• The ellipsoid method and its consequences in combinatorial optimization
• Layered Augmenting Path Algorithms
• Maximal Closure of a Graph and Applications to Combinatorial Problems

This page was built for publication: A rounding technique for the polymatroid membership problem