system approximation algorithms generated by ϑ summations.
Ferenc SchippJozsef BokorPublished in: Autom. (1997)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- vertex cover
- primal dual
- randomized algorithms
- facility location problem
- approximation ratio
- exact algorithms
- network design problem
- set cover
- np hardness
- open shop
- constant factor
- lower bound
- precedence constraints
- combinatorial auctions
- disjoint paths
- polynomial time approximation