Constant-Work-Space Algorithms for Geometric Problems.
Tetsuo AsanoWolfgang MulzerGünter RoteYajun WangPublished in: J. Comput. Geom. (2011)
Keyphrases
- computational geometry
- optimization problems
- orders of magnitude
- related problems
- np hard problems
- test problems
- computationally efficient
- computationally hard
- times faster
- benchmark problems
- computational problems
- exact and approximate
- computer vision
- hard problems
- inference problems
- approximate solutions
- partial solutions
- convex optimization problems
- heuristic methods
- theoretical analysis
- search space
- computational complexity
- difficult problems
- combinatorial optimization
- problems in computer vision
- computational cost
- multi objective
- greedy algorithms
- significant improvement
- evolutionary algorithm
- data mining
- run times