skip to content
The euclidean Traveling Salesman Problem is NP-Complete Preview this item
ClosePreview this item
Checking...

The euclidean Traveling Salesman Problem is NP-Complete

Author: Christos H Papadimitriou
Publisher: [Princeton, NJ] 1976
Series: [Technical report] / [Computer Science Laboratory, Department of Electrical Egineering, Princeton University], 189; Technical report, Computer Science Laboratory, 1966, 189
Edition/Format:   Book : English
Publication:Theoretical computer science ; 4.1977
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Christos H Papadimitriou
OCLC Number: 552247805
Description: S. 237 - 244
Series Title: [Technical report] / [Computer Science Laboratory, Department of Electrical Egineering, Princeton University], 189; Technical report, Computer Science Laboratory, 1966, 189
Responsibility: Christos H. Papadimitriou

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.