On the approximability of the traveling salesman problem (extended abstract)
Christos H. Papadimitriou, Santosh Vempala · 2000
Article Free Access Share on On the approximability of the traveling salesman problem (extended abstract) Authors: Christos H. Papadimitriou Computer Science Department, U.C. Berkeley Computer Science Department, U.C. BerkeleyView Profile , Santosh Vempala Department of Mathematics and Laboratory for Computer Science, MIT Department of Mathematics and Laboratory for Computer Science, MITView Profile Authors Info & Claims STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computingMay 2000 Pages 126–133https://doi.org/10.1145/335305.335320Published:01 May 2000Publication History 40citation773DownloadsMetricsTotal Citations40Total Downloads773Last 12 Months32Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF