Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs

  • André Berger
  • Michelangelo Grigni
Conference paper

DOI: 10.1007/978-3-540-73420-8_10

Volume 4596 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Berger A., Grigni M. (2007) Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs. In: Arge L., Cachin C., Jurdziński T., Tarlecki A. (eds) Automata, Languages and Programming. ICALP 2007. Lecture Notes in Computer Science, vol 4596. Springer, Berlin, Heidelberg

Abstract

We present a linear time algorithm exactly solving the 2-edge connected spanning subgraph (2-ECSS) problem in a graph of bounded treewidth. Using this with Klein’s diameter reduction technique [15], we find a linear time PTAS for the problem in unweighted planar graphs, and the first PTAS for the problem in weighted planar graphs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • André Berger
    • 1
  • Michelangelo Grigni
    • 2
  1. 1.Department of Mathematics, Technical University Berlin, Axel-Springer-Str. 54A, 10623 BerlinGermany
  2. 2.Department of Mathematics and Computer Science, Emory University, Atlanta GA 30322USA