Rounding algorithms for covering problems.
Dimitris BertsimasRakesh V. VohraPublished in: Math. Program. (1998)
Keyphrases
- optimization problems
- practical problems
- theoretical analysis
- problems in computer vision
- difficult problems
- data structure
- related problems
- hard problems
- combinatorial optimization
- search methods
- specific problems
- exact and approximate
- orders of magnitude
- computationally efficient
- computational cost
- computational complexity
- computationally hard
- genetic algorithm
- computational problems
- run times
- computational geometry
- exact algorithms
- partial solutions
- approximation algorithms
- machine learning algorithms
- learning algorithm