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

@inproceedings{Berger2007MinimumW2,
  title={Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs},
  author={Andr{\'e} Berger and Michelangelo Grigni},
  booktitle={ICALP},
  year={2007}
}
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. 

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 16 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 20 REFERENCES

A linear-time approximation scheme for planar weighted TSP

  • 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
  • 2005
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

A PolynomialTime Approximation Scheme for Steiner Tree in Planar Graphs

Glencora Borradaile, Claire Kenyon-Mathieu, Philip Klein
  • In Proceedings of the Eighteenth Annual ACM-SIAM SODA, New York,
  • 2007
VIEW 1 EXCERPT

Bodlaender . A linear time algorithm for finding tree - decompositions of small treewidth

L Hans
  • SIAM Journal on Computing
  • 2005