A Limited-Backtrack Greedy Schema for Approximation Algorithms.
Vivek AroraSantosh S. VempalaHuzur SaranVijay V. VaziraniPublished in: FSTTCS (1994)
Keyphrases
- approximation algorithms
- np hard
- worst case
- search algorithm
- special case
- greedy algorithm
- vertex cover
- minimum cost
- facility location problem
- exact algorithms
- data model
- network design problem
- randomized algorithms
- approximation ratio
- open shop
- approximation schemes
- precedence constraints
- np hardness
- greedy heuristic
- constant factor approximation
- dynamic programming
- primal dual
- set cover
- combinatorial auctions
- search tree
- constant factor
- polynomial time approximation
- scheduling problem
- approximation guarantees
- error bounds
- linear program
- search space