%0 Journal Article %1 journals/tcs/Papadimitriou77 %A Papadimitriou, Christos H. %D 1977 %J Theor. Comput. Sci. %K dblp %N 3 %P 237-244 %T The Euclidean Traveling Salesman Problem is NP-Complete. %U http://dblp.uni-trier.de/db/journals/tcs/tcs4.html#Papadimitriou77 %V 4

@article{journals/tcs/Papadimitriou77, added-at = {2021-02-17T00:00:00.000+0100}, author = {Papadimitriou, Christos H.}, biburl = {https://www.bibsonomy.org/bibtex/2eeaf7d2d308dc4101ec518d6b3867db2/dblp}, ee = {https://www.wikidata.org/entity/Q56067404}, interhash = {51c79083afe9c388d65b6c3cc5ebea47}, intrahash = {eeaf7d2d308dc4101ec518d6b3867db2}, journal = {Theor. Comput. Sci.}, keywords = {dblp}, number = 3, pages = {237-244}, timestamp = {2024-04-08T18:45:29.000+0200}, title = {The Euclidean Traveling Salesman Problem is NP-Complete.}, url = {http://dblp.uni-trier.de/db/journals/tcs/tcs4.html#Papadimitriou77}, volume = 4, year = 1977 }