Approximation Algorithms in Batch Processing.
Xiaotie DengChung Keung PoonYuzhong ZhangPublished in: ISAAC (1999)
Keyphrases
- approximation algorithms
- batch processing
- np hard
- special case
- minimum cost
- worst case
- vertex cover
- facility location problem
- approximation ratio
- set cover
- precedence constraints
- open shop
- np hardness
- network design problem
- randomized algorithms
- exact algorithms
- primal dual
- disjoint paths
- constant factor
- optimal solution
- undirected graph
- combinatorial auctions
- polynomial time approximation
- knapsack problem
- greedy algorithm