Last update: Thu Sep 27 02:46:39 MDT 2018
@Article{Papadimitriou:1977:ETS, author = "C. H. Papadimitriou", title = "The {Euclidean} traveling salesman problem is {NP-complete}", journal = j-THEOR-COMP-SCI, volume = "4", number = "3", pages = "237--244", month = jun, year = "1977", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:36:07 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1975.bib", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques)", corpsource = "Center for Res. in Computing Technol., Harvard Univ., Cambridge, MA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Euclidean; NP-complete; optimisation; travelling salesman problem", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }