Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials.
Viresh PatelGuus RegtsPublished in: CoRR (2016)
Keyphrases
- approximation algorithms
- undirected graph
- randomized algorithms
- np hard
- special case
- worst case
- constant factor
- approximation ratio
- approximation guarantees
- disjoint paths
- vertex cover
- vertex set
- minimum cost
- approximation schemes
- facility location problem
- np hardness
- set cover
- network design problem
- min cut
- primal dual
- precedence constraints
- open shop
- random walk
- spanning tree
- combinatorial auctions
- graph structure
- constant factor approximation
- graph partitioning
- directed acyclic graph