Journal ArticleOPEN ACCESS

The complexity of facets resolved

Journal of Computer and System Sciences (1988) 37(1) 2-13
DOI: 10.1016/0022-0000(88)90042-6
150Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We show that recognizing the facets of the traveling salesman problem polytope is Dp-complete. © 1988.

Cite

CITATION STYLE

APA

Papadimitriou, C. H., & Wolfe, D. (1988). The complexity of facets resolved. Journal of Computer and System Sciences, 37(1), 2–13. https://doi.org/10.1016/0022-0000(88)90042-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free