Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs.
Artur CzumajMichelangelo GrigniPapa A. SissokhoHairong ZhaoPublished in: SODA (2004)
Keyphrases
- approximation schemes
- planar graphs
- undirected graph
- approximation algorithms
- weighted graph
- minimum cost
- edge detection
- numerical methods
- edge information
- connected components
- edge detector
- computer vision
- minimum weight
- special case
- bin packing
- markov random field
- approximate inference
- spanning tree
- boundary points
- bipartite graph
- shortest path
- higher order
- np hard
- optimal solution
- bayesian networks