Worst-Case Performance Analysis of Some Approximation Algorithms for Minimizing Makespan and Flow-Time.
Peruvemba Sundaram RaviLevent TunçelMichael HuangPublished in: CoRR (2013)
Keyphrases
- approximation algorithms
- minimizing makespan
- worst case
- scheduling problem
- np hard
- vertex cover
- min cost
- average case
- upper bound
- lower bound
- flowshop
- error bounds
- special case
- primal dual
- approximation ratio
- minimum cost
- constant factor
- np hardness
- network design problem
- computational complexity
- open shop
- randomized algorithms
- constant factor approximation
- set cover
- precedence constraints
- greedy algorithm
- integer programming
- single machine
- tabu search
- greedy heuristic
- approximation guarantees
- undirected graph
- processing times