Covering skew-supermodular functions by hypergraphs of minimum total size
From MaRDI portal
Publication:1038104
DOI10.1016/j.orl.2009.04.002zbMath1210.05087OpenAlexW2094190320MaRDI QIDQ1038104
Publication date: 17 November 2009
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10831/10595
Related Items (2)
Characterizing and recognizing generalized polymatroids ⋮ A Survey on Covering Supermodular Functions
Cites Work
- Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
- Generalized polymatroids and submodular flows
- Hypergraph connectivity augmentation
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A Survey on Covering Supermodular Functions
- Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Covering skew-supermodular functions by hypergraphs of minimum total size