A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity.
Lisa FleischerPublished in: IPCO (2001)
Keyphrases
- minimum cost
- approximation algorithms
- undirected graph
- approximation ratio
- np hard
- network flow
- special case
- network flow problem
- capacity constraints
- minimum cost flow
- spanning tree
- network simplex algorithm
- primal dual
- strongly connected
- worst case
- triangle mesh
- directed graph
- linear programming
- network design problem
- connected components
- edit operations
- integrality gap
- objective function