On the Structure of Minimum-Weight k-Connected Spanning Networks
- 1 August 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 3 (3), 320-329
- https://doi.org/10.1137/0403027
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity ConstraintsSIAM Journal on Discrete Mathematics, 1990
- Minimum-weight two-connected spanning networksMathematical Programming, 1990
- Methods for Designing Communications Networks with Certain Two-Connected Survivability ConstraintsOperations Research, 1989
- On the relationship between the biconnectivity augmentation and travelling salesman problemsTheoretical Computer Science, 1982
- A Reduction Method for Edge-Connectivity in GraphsPublished by Elsevier BV ,1978
- The Design of Minimum-Cost Survivable NetworksIEEE Transactions on Circuit Theory, 1969