<--- Back to Details
First PageDocument Content
Approximation algorithms / NP-complete problems / Complexity classes / Operations research / Travelling salesman problem / APX / Polynomial-time approximation scheme / Time complexity / Set TSP problem / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2013-09-09 07:23:49
Approximation algorithms
NP-complete problems
Complexity classes
Operations research
Travelling salesman problem
APX
Polynomial-time approximation scheme
Time complexity
Set TSP problem
Theoretical computer science
Computational complexity theory
Applied mathematics

Add to Reading List

Source URL: theory.cs.uni-bonn.de

Download Document from Source Website

File Size: 105,67 KB

Share Document on Facebook

Similar Documents

Computational complexity theory / Graph theory / NP-complete problems / Mathematics / Travelling salesman problem / Set TSP problem / Steiner tree problem / Vertex cover / Approximation algorithm / APX / Cut / Time complexity

comput. complex), 281 – 040281–27 DOIs00037c Birkh¨

DocID: 1rc9S - View Document

Peer mentoring / WestEd / Special education / Set TSP problem / Education / Educational psychology / Disability

June 2007 Research Brief (PDF) - The Teacher Support Program

DocID: xZE4 - View Document

Approximation algorithms / NP-complete problems / Complexity classes / Operations research / Travelling salesman problem / APX / Polynomial-time approximation scheme / Time complexity / Set TSP problem / Theoretical computer science / Computational complexity theory / Applied mathematics

PDF Document

DocID: 1BEy - View Document