Approximation algorithms for flexible graph connectivity
- 26 April 2023
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 204 (1-2) , 493-516
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (CCF-1918656)
- Natural Sciences and Engineering Research Council of Canada (RGPIN-2019-04197, 327620-09)
This publication has 17 references indexed in Scilit:
- Approximability of Capacitated Network DesignAlgorithmica, 2014
- Iterated Rounding Algorithms for the Smallest k-Edge Connected Spanning SubgraphSIAM Journal on Computing, 2012
- Approximating the smallest k‐edge connected spanning subgraph by LP‐roundingNetworks, 2008
- An Ear Decomposition Approach to Approximating the Smallest 3-Edge Connected Spanning Subgraph of a MultigraphSIAM Journal on Discrete Mathematics, 2004
- A Factor 2 Approximation Algorithm for the Generalized Steiner Network ProblemCombinatorica, 2001
- Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run TimeJournal of Algorithms, 1999
- Computing All Small Cuts in an Undirected NetworkSIAM Journal on Discrete Mathematics, 1997
- A primal-dual approximation algorithm for generalized steiner network problemsCombinatorica, 1995
- Biconnectivity approximations and graph carvingsJournal of the ACM, 1994
- Conservative weightings and ear-decompositions of graphsCombinatorica, 1993