Parallel Multidimensional Search Using Approximation Algorithms: With Applications to Linear-Programming and Related Problems.
Sandeep SenPublished in: SPAA (1996)
Keyphrases
- approximation algorithms
- related problems
- linear programming
- np hard
- primal dual
- special case
- vertex cover
- worst case
- search space
- search algorithm
- minimum cost
- facility location problem
- approximation ratio
- approximation schemes
- optimal solution
- np hardness
- open shop
- broadly applicable
- solution space
- objective function
- quadratic programming
- network design problem
- column generation
- set cover
- metaheuristic
- constant factor
- polynomial time approximation
- multi dimensional
- upper bound
- computational complexity