Linear-time approximation schemes for planar minimum three-edge connected and three-vertex connected spanning subgraphs
Data Structures and Algorithms
2017-01-31 v1
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.
Cite
@article{arxiv.1701.08315,
title = {Linear-time approximation schemes for planar minimum three-edge connected and three-vertex connected spanning subgraphs},
author = {Baigong Zheng},
journal= {arXiv preprint arXiv:1701.08315},
year = {2017}
}