Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?.
Tetsuo AsanoPublished in: ISAAC (2008)
Keyphrases
- optimization problems
- practical problems
- combinatorial optimization
- np hard problems
- benchmark problems
- computational complexity
- problems in computer vision
- test problems
- related problems
- search problems
- orders of magnitude
- machine learning algorithms
- theoretical analysis
- difficult problems
- greedy algorithms
- computational geometry
- solving complex
- convex optimization problems
- computationally hard
- finding optimal solutions
- hard problems
- efficient algorithms for solving
- exact and approximate
- specific problems
- exact algorithms
- approximate solutions
- heuristic methods
- space complexity
- mathematical programming
- computationally efficient
- high dimensional