A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs.

Glencora Borradaile Baigong Zheng

Published in: APPROX-RANDOM (2017)

Keyphrases

planar graphs
weighted graph
undirected graph
approximation algorithms
edge detection
minimum weight
edge information
polynomial time approximation
edge detector
connected components
bipartite graph
approximate inference
edge map
edge weights
linear programming
np hard
pairwise