<--- Back to Details
First PageDocument Content
Computational complexity theory / Approximation algorithms / NP-complete problems / Complexity classes / Theoretical computer science / Travelling salesman problem / APX / Optimization problem / Combinatorial optimization / Genetic algorithm / Heuristic / Steiner tree problem
Date: 2008-10-23 07:53:58
Computational complexity theory
Approximation algorithms
NP-complete problems
Complexity classes
Theoretical computer science
Travelling salesman problem
APX
Optimization problem
Combinatorial optimization
Genetic algorithm
Heuristic
Steiner tree problem

On the Computational Complexity of ReoptimizationScientific Work

Document is deleted from original location.
Use the Download Button below to download from the Web Archive.

Download Document from Web Archive

File Size: 101,69 KB