Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials.
Viresh PatelGuus RegtsPublished in: Electron. Notes Discret. Math. (2017)
Keyphrases
- approximation algorithms
- randomized algorithms
- undirected graph
- np hard
- special case
- constant factor
- worst case
- approximation ratio
- minimum cost
- approximation guarantees
- disjoint paths
- vertex cover
- np hardness
- primal dual
- network design problem
- set cover
- approximation schemes
- facility location problem
- open shop
- scheduling problem
- min cut
- spanning tree
- vertex set
- polynomial time approximation
- np complete
- precedence constraints
- graph structure
- weighted graph
- directed acyclic graph
- graph model
- integer programming
- bipartite graph
- planar graphs
- optimal solution
- combinatorial auctions
- computational complexity