A priori TSP in the scenario model
Authors:
- 1 December 2018
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 250, 331-341
Abstract
No abstract availableKeywords
Funding Information
- NWO (612.001.215)
- NWO (639.072.602)
- 4TU Applied Mathematics Institute
This publication has 15 references indexed in Scilit:
- Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation ResistantSIAM Journal on Computing, 2011
- Algorithms for the universal and a priori TSPOperations Research Letters, 2008
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?SIAM Journal on Computing, 2007
- Some optimal inapproximability resultsJournal of the ACM, 2001
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problemsJournal of the ACM, 1998
- Sometimes Travelling is Easy: The Master Tour ProblemSIAM Journal on Discrete Mathematics, 1998
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- Cyclic ordering is NP-completeTheoretical Computer Science, 1977
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Regular Graphs with Given Girth and Restricted CircuitsJournal of the London Mathematical Society, 1963