Back to Results
First PageMeta Content
NP-complete problems / Operations research / Combinatorial optimization / Travelling salesman problem / Cubic graph / Hamiltonian path / Gadget / Degree / Regular graph / Graph theory / Theoretical computer science / Mathematics


Approximation Hardness of Graphic TSP on Cubic Graphs Marek Karpinski∗ Richard Schmied†
Add to Reading List

Document Date: 2013-04-25 00:45:46

Open Document

File Size: 306,73 KB

Share Result on Facebook

/

Facility

We shed / University of Bonn / /

IndustryTerm

polynomial time approximation algorithms / /

Organization

Hausdorff Center for Mathematics / University of Bonn / /

Position

Traveling Salesman / /

Technology

polynomial time approximation algorithms / /

SocialTag