Linear-time approximation schemes for planar minimum three-edge connected and three-vertex connected spanning subgraphs
classification
💻 cs.DS
keywords
approximationconnectedminimumschemesspanningepsilonplanarproblem
read the original abstract
We present the first polynomial-time approximation schemes, i.e., (1 + {\epsilon})-approximation algorithm for any constant {\epsilon} > 0, for the minimum three-edge connected spanning subgraph problem and the minimum three-vertex connected spanning subgraph problem in undirected planar graphs. Both the approximation schemes run in linear time.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.