Applications of polymatroids to connectivity augmentation
Conference
·
OSTI ID:36025
We show how polymatroids may be used in connectivity augmentation problems In particular, a min-max theorem is proved for the minimum number of new edges required to be added to a directed graph to make it k-connected Polymatroids help to solve the minimum cost augmentation problem when a cost function is given on the node-set.
- OSTI ID:
- 36025
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Connectivity augmentation problems in network design
New network decomposition theorems with applications
Approximating minimum-size k-connected spanning subgraphs via matching
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36026
New network decomposition theorems with applications
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36395
Approximating minimum-size k-connected spanning subgraphs via matching
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:457660