Back to Results
First PageMeta Content
Computational complexity theory / Approximation algorithms / Complexity classes / Operations research / NP-complete problems / Polynomial-time approximation scheme / Travelling salesman problem / Steiner tree problem / APX / Optimization problem / Combinatorial optimization / NP


Theoretical Computer Science–2863 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs
Add to Reading List

Document Date: 2014-11-26 08:32:25

Open Document

File Size: 514,80 KB

Share Result on Facebook