Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs.
Sariel Har-PeledKent QuanrudPublished in: SIAM J. Comput. (2017)
Keyphrases
- approximation algorithms
- low density
- undirected graph
- high density
- np hard
- special case
- minimum cost
- worst case
- vertex cover
- primal dual
- network design problem
- constant factor
- facility location problem
- graph mining
- approximation schemes
- set cover
- constant factor approximation
- approximation guarantees
- np hardness
- spanning tree
- open shop
- approximation ratio
- precedence constraints
- randomized algorithms
- combinatorial auctions
- weighted graph
- graph structure
- disjoint paths
- data center