Back to Results
First PageMeta Content
Combinatorial optimization / NP-complete problems / Operations research / Travelling salesman problem / Matching / Graph / Cut / Connectivity / Eulerian path / Graph theory / Mathematics / Theoretical computer science


New Inapproximability Bounds for TSP Marek Karpinski∗ Michael Lampis† Richard Schmied‡
Add to Reading List

Document Date: 2013-03-26 06:58:50

Open Document

File Size: 315,44 KB

Share Result on Facebook

/

Facility

KTH Royal Institute of Technology / University of Bonn / /

IndustryTerm

suitable tool / approximation algorithm / /

Organization

University of Bonn / Hausdorff Center for Mathematics / Institute of Technology / /

Person

Michael Lampis† Richard Schmied / Marek Karpinski∗ Michael Lampis / /

Position

Introduction The Traveling Salesman / metric Traveling Salesman / Asymmetric Traveling Salesman / /

Technology

approximation algorithm / /

SocialTag