A note on optimal covering augmentation for graphic polymatroids.
From MaRDI portal
Publication:1603399
DOI10.1016/S0020-0190(01)00140-5zbMath1051.68144MaRDI QIDQ1603399
H. Narayanan, Sachin B. Patkar
Publication date: 14 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Submodular functions and optimization
- A faster algorithm for computing the strength of a network
- Submodular functions and electrical networks
- Optimal attack and reinforcement of a network
- A new approach to the maximum-flow problem
- Improved Algorithms for Bipartite Network Flow
- Algorithms for Graphic Polymatroids and Parametrics-Sets
- A Fast Parametric Maximum Flow Algorithm and Applications
- Approximation Algorithms for Min-k-Overlap Problems Using the Principal Lattice of Partitions Approach
This page was built for publication: A note on optimal covering augmentation for graphic polymatroids.