Connectivity augmentation problems in network design
Conference
·
OSTI ID:36026
The problem of connectivity augmentation consists of finding a minimum cost of new edges to be added to a given graph so as to satisfy some prescribed connectivity requirements. This paper surveys cases when polynomial time algorithms and/or good characterizations are available for the minimum.
- OSTI ID:
- 36026
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Applications of polymatroids to connectivity augmentation
Bicriteria network design problems
Approximation algorithms for network design problems on bounded subsets
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36025
Bicriteria network design problems
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:39638
Approximation algorithms for network design problems on bounded subsets
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36130