Back to Results
First PageMeta Content
Complexity classes / NP-complete problems / Operations research / Approximation algorithms / Travelling salesman problem / Combinatorial optimization / APX / Optimization problem / PCP theorem / Theoretical computer science / Computational complexity theory / Applied mathematics


TSP with Bounded Metrics Lars Engebretsen1,? and Marek Karpinski2,?? 1 Department of Numerical Analysis and Computer Science Royal Institute of Technology
Add to Reading List

Document Date: 2006-02-09 12:47:04

Open Document

File Size: 322,04 KB

Share Result on Facebook

City

Stockholm / /

/

Event

Person Communication and Meetings / /

Facility

Computer Science University of Bonn / Computer Science Royal Institute / /

/

IndustryTerm

elegant algorithm / /

Organization

Marcus Wallenberg Foundation / Department of Numerical Analysis / Numerical Analysis and Computer Science Royal Institute / Royal Swedish Academy of Sciences / Computer Science University of Bonn / MIT / Marek Karpinski Department / Institute of Technology / /

Person

Marek Karpinski / /

/

Position

author / secretary / Traveling Salesman / Asymmetric Traveling Salesman / Corresponding author / /

ProgrammingLanguage

TSP / /

Technology

improved algorithm / elegant algorithm / /

URL

http /

SocialTag