Spatial mixing and approximation algorithms for graphs with bounded connective constant.
Alistair SinclairPiyush SrivastavaYitong YinPublished in: CoRR (2013)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- constant factor
- special case
- minimum cost
- vertex cover
- worst case
- approximation ratio
- network design problem
- approximation schemes
- facility location problem
- disjoint paths
- set cover
- open shop
- combinatorial auctions
- graph matching
- randomized algorithms
- spanning tree
- directed graph
- approximation guarantees
- computational complexity
- primal dual
- precedence constraints
- weighted graph
- bipartite graph
- np complete
- polynomial time approximation
- scheduling problem
- search algorithm