Abstract
We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are resistant to edge or vertex removal. We first give a PTAS for the problem of finding minimum-weight 2-edge-connected spanning subgraphs where duplicate edges are allowed. Then we present a new greedy spanner construction for edge-weighted planar graphs, which augments any connected subgraph A of a weighted planar graph G to a (1+ε)-spanner of G with total weight bounded by weight(A)/ε. From this we derive quasi-polynomial time approximation schemes for the problems of finding the minimum-weight 2-edge-connected or biconnected spanning subgraph in planar graphs. We also design approximation schemes for the minimum-weight 1-2-connectivity problem, which is the variant of the survivable network design problem where vertices have 1 or 2 connectivity constraints. Prior to our work, for all these problems no polynomial or quasi-polynomial time algorithms were known to achieve an approximation ratio better than 2.
Research supported in part by NSF grants CCR-0208929 and ITR-CCR-0313219.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Althöfer, I., Das, G., Dobkin, D., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete Comput. Geom. 9, 81–100 (1993)
Arora, S., Grigni, M., Karger, D., Klein, P., Woloszyn, A.: A polynomial time approximation scheme for weighted planar graph TSP. In: SODA 1998, pp. 33–41 (1998)
Berger, A., Grigni, M., Zhao, H.: A well-connected separator for planar graphs (2004) (Manuscript)
Cheriyan, J., Vempala, S., Vetta, A.: An approximation algorithm for the minimum-size k-vertex connected subgraph. SIAM J. Comput. 32(4), 1050–1055 (2003)
Czumaj, A., Grigni, M., Sissokho, P., Zhao, H.: Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs. In: SODA 2004, pp. 489–498 (2004)
Czumaj, A., Lingas, A.: On approximability of the minimum-cost k-connected spanning subgraph problem. In: SODA 1999, pp. 281–290 (1999)
Czumaj, A., Lingas, A.: Fast approximation schemes for Euclidean multi-connectivity problems. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 856–868. Springer, Heidelberg (2000)
Czumaj, A., Lingas, A., Zhao, H.: Polynomial-time approximation schemes for the Euclidean survivable network design problem. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 973–984. Springer, Heidelberg (2002)
Fleischer, L.K.: A 2-approximation for minimum cost {0,1,2} vertex connectivity. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 115–129. Springer, Heidelberg (2001)
Gabow, H.N.: An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph. In: SODA 2002, pp. 84–93 (2002)
Gabow, H.N.: Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph. In: SODA 2003, pp. 460–469 (2003)
Grötschel, M., Monma, C.L., Stoer, M.: Design of survivable networks. In: Ball, M.O., et al. (eds.) Handbooks in Operations Research and Management Science, Network Models, ch. 10, vol. 7, pp. 617–672. North-Holland, Amsterdam (1995)
Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21(1), 39–60 (2001)
Jothi, R., Raghavachari, B., Varadarajan, S.: A 5/4-approximation algorithm for minimum 2-edge-connectivity. In: SODA 2003, pp. 725–734 (2003)
Khuller, S.: Approximation algorithms for finding highly connected subgraphs. In: Hochbaum, D.S. (ed.) Approximation Algorithms for \(\mathcal{NP}\)-Hard Problems, pp. 236–265 (1996)
Khuller, S., Vishkin, U.: Biconnectivity approximations and graph carvings. Journal of the ACM 41(2), 214–235 (1994)
Kortsarz, G., Nutov, Z.: Approximation algorithm for k-node connected subgraphs via critical graphs. In: STOC 2004, pp. 138–145 (2004)
Krysta, P.: Approximating minimum size 1,2-connected networks. Discrete Appl. Math. 125, 267–288 (2003)
Levcopoulos, C., Narasimhan, G., Smid, M.H.M.: Efficient algorithms for constructing fault-tolerant geometric spanners. In: STOC 1998, pp. 186–195 (1998)
Penn, M., Shasha-Krupnik, H.: Improved approximation algorithms for weighted 2- and 3-vertex connectivity augmentation problems. J. Algorithms 22, 187–196 (1997)
Rao, S.B., Smith, W.D.: Approximating geometrical graphs via “spanners” and “banyans”. In: STOC 1998, pp. 540–550 (1998)
Stoer, M.: Design of Survivable Networks. Lect. Notes in Math., vol. 1531. Springer, Heidelberg (1992)
Vempala, S., Vetta, A.: Factor 4/3 approximations for minimum 2-connected subgraphs. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 262–273. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berger, A., Czumaj, A., Grigni, M., Zhao, H. (2005). Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. In: Brodal, G.S., Leonardi, S. (eds) Algorithms – ESA 2005. ESA 2005. Lecture Notes in Computer Science, vol 3669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561071_43
Download citation
DOI: https://doi.org/10.1007/11561071_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29118-3
Online ISBN: 978-3-540-31951-1
eBook Packages: Computer ScienceComputer Science (R0)