Spatial Mixing and Approximation Algorithms for Graphs with Bounded Connective Constant.
Alistair SinclairPiyush SrivastavaYitong YinPublished in: FOCS (2013)
Keyphrases
- approximation algorithms
- undirected graph
- constant factor
- np hard
- special case
- vertex cover
- worst case
- facility location problem
- minimum cost
- network design problem
- approximation ratio
- open shop
- set cover
- np hardness
- approximation guarantees
- precedence constraints
- spanning tree
- graph matching
- combinatorial auctions
- linear programming
- lower bound
- planar graphs
- randomized algorithms
- disjoint paths