The complexity of facets resolved. (English) Zbl 0655.68041
Summary: We show that recognizing the facets of the traveling salesman problem polytope is D p-complete.
References:
| [1] | Bajaj, C., Geometric Optimization and Computational Complexity (1984), Cornell University, TR 84-624 |
| [2] | Blass, A.; Gurevich, Y., On the unique satisfiability problem, Inform. and Control, 55, 80-88 (1982) · Zbl 0543.03027 |
| [3] | Chvatal, V., On certain polytopes associated with graphs, J. Combin. Theory Ser. B, 18, 138-154 (1975) · Zbl 0277.05139 |
| [4] | Cai, J.; Meyer, G. E., Graph Minimal Uncolorability is \(D^p\)-complete (1985), Cornell University, TR 85-688 |
| [5] | Cosmadakis, S., The complexity of answering relational queries, Inform. and Control, 63 (1984) |
| [6] | Dantzig, G. B.; Fulkerson, D. R.; Johnson, S. M., Solution of a large-scale traveling salesman problem, Oper. Res., 2, 393-410 (1954) · Zbl 1414.90372 |
| [7] | Garey, M.; Johnson, D.; Tarjan, R., The planar Hamiltonian circuit problem is NP-complete, SIAM J. Comput., 5, No. 4, 704-714 (1976) · Zbl 0346.05110 |
| [8] | Garey, M.; Johnson, D., Computers and Intractability (1979), Freeman: Freeman San Francisco · Zbl 0411.68039 |
| [9] | Grötschel, M., On the monotone symmetric traveling salesman problem: Hypohamiltonian/hypotraceable graphs and facets, Math. Oper. Res., 5, 285-292 (1980) · Zbl 0442.90070 |
| [10] | Grötschel, M., Polyhedral combinatorics—An annotated bibliography, (Combinatorial Optimization (1985), Wiley: Wiley New York) |
| [11] | Grötschel, M.; Padberg, S., On the symmetric traveling salesman problem II: Lifting theorem and facets, Math. Progr., 16, 281-302 (1979) · Zbl 0413.90049 |
| [12] | Papadimitriou, C. H.; Steiglitz, K., Combinatorial Optimization: Algorithms and Complexity (1982), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ · Zbl 0503.90060 |
| [13] | Papadimitriou, C. H.; Yannakakis, M., The complexity of facets (and some facets of complexity), J. Comput. System Sci., 28, No. 2, 244-259 (1982) · Zbl 0571.68028 |
| [14] | Valiant, L. G.; Vazirani, V. V., NP is a easy as detecting unique solutions, (Proceedings, 25th Found. of Comput. Sci. (1984)) · Zbl 0621.68030 |
| [15] | V. V. Vazirani, private communication, 1985.; V. V. Vazirani, private communication, 1985. |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
