Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs-Reference-Cited by-同舟云学术

Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs

Published:2005 Issue: Volume: Page:472-483
ISSN:0302-9743
Container-title:Algorithms – ESA 2005
language:
Short-container-title:

Author:

Berger André,Czumaj Artur,Grigni Michelangelo,Zhao Hairong

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11561071_43.pdf

Reference23 articles.

1. Althöfer, I., Das, G., Dobkin, D., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete Comput. Geom. 9, 81–100 (1993)

2. 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)

3. Berger, A., Grigni, M., Zhao, H.: A well-connected separator for planar graphs (2004) (Manuscript)

4. 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)

5. 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)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs;ACM Transactions on Algorithms;2016-06-15

2. Minimum k-Connected Geometric Networks;Encyclopedia of Algorithms;2016

3. Minimum k-Connected Geometric Networks;Encyclopedia of Algorithms;2014

4. Light Spanners in Bounded Pathwidth Graphs;Mathematical Foundations of Computer Science 2012;2012

5. Approximation algorithms via contraction decomposition;Combinatorica;2010-09