Back to Results
First PageMeta Content
Operations research / NP-complete problems / Combinatorial optimization / Approximation algorithms / Travelling salesman problem / Christofides algorithm / Polynomial-time approximation scheme / Optimization problem / Knapsack problem / Theoretical computer science / Computational complexity theory / Applied mathematics


Coping With NP-Hardness Approximation Algorithms
Add to Reading List

Document Date: 2001-05-07 12:05:44

Open Document

File Size: 140,63 KB

Share Result on Facebook
UPDATE