Approximation Algorithms for k-Connected Graph Factors.
Bodo MantheyMarten WaandersPublished in: WAOA (2015)
Keyphrases
- approximation algorithms
- undirected graph
- constant factor
- connected components
- np hard
- special case
- disjoint paths
- vertex cover
- worst case
- facility location problem
- minimum cost
- primal dual
- network design problem
- random walk
- set cover
- approximation ratio
- open shop
- spanning tree
- graph structure
- approximation schemes
- precedence constraints
- bipartite graph
- approximation guarantees
- directed graph
- graph model
- weighted graph
- randomized algorithms
- strongly np hard
- connected graphs