Back to Results
First PageMeta 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


Document Date: 2013-09-09 07:23:49

Open Document

File Size: 105,67 KB

Share Result on Facebook

Company

SIAM Journal / /

/

Facility

University of Bonn Email / Carnegie Mellon University / /

IndustryTerm

approximation algorithms / /

Organization

Carnegie Mellon University / University of Bonn Email / /

/

Position

General / Salesman / Traveling Salesman / Asymmetric Traveling Salesman / /

ProgrammingLanguage

TSP / /

PublishedMedium

SIAM Journal on Computing / Journal of the ACM / /

Technology

approximation algorithms / 3/4-Approximation Algorithm / Approximation Algorithm / 8/7-Approximation Algorithm / /

URL

http /

SocialTag