![NP-complete problems / Operations research / Combinatorial optimization / Travelling salesman problem / Cubic graph / Hamiltonian path / Gadget / Degree / Regular graph / Graph theory / Theoretical computer science / Mathematics NP-complete problems / Operations research / Combinatorial optimization / Travelling salesman problem / Cubic graph / Hamiltonian path / Gadget / Degree / Regular graph / Graph theory / Theoretical computer science / Mathematics](https://www.pdfsearch.io/img/191c8c2c5a13df9ec3dfe7ddd54ab346.jpg)
| Document Date: 2013-04-25 00:45:46 Open Document File Size: 306,73 KBShare 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 |