Approximation Algorithms for Low-Density Graphs.
Sariel Har-PeledKent QuanrudPublished in: CoRR (2015)
Keyphrases
- approximation algorithms
- low density
- undirected graph
- high density
- np hard
- special case
- minimum cost
- worst case
- vertex cover
- network design problem
- approximation guarantees
- facility location problem
- approximation ratio
- open shop
- set cover
- graph matching
- np hardness
- primal dual
- constant factor
- graph structure
- approximation schemes
- constant factor approximation
- disjoint paths
- precedence constraints
- directed graph
- spanning tree
- low cost
- computational complexity