@inproceedings{DBLP:conf/stoc/PapadimitriouV00,
  author    = {Christos H. Papadimitriou and
               Santosh Vempala},
  title     = {On the approximability of the traveling salesman problem (extended
               abstract)},
  booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
               of Computing, May 21-23, 2000, Portland, OR, {USA}},
  pages     = {126--133},
  year      = {2000},
  crossref  = {DBLP:conf/stoc/2000},
  url       = {https://doi.org/10.1145/335305.335320},
  doi       = {10.1145/335305.335320},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/PapadimitriouV00},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"7A7kFsvNXno7tqnBG","bibbaseid":"papadimitriou-vempala-ontheapproximabilityofthetravelingsalesmanproblemextendedabstract-2000","downloads":0,"creationDate":"2019-02-04T10:40:09.090Z","title":"On the approximability of the traveling salesman problem (extended abstract)","author_short":["Papadimitriou, C. H.","Vempala, S."],"year":2000,"bibtype":"inproceedings","biburl":"https://dblp.org/pid/v/SantoshVempala.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Christos","H."],"propositions":[],"lastnames":["Papadimitriou"],"suffixes":[]},{"firstnames":["Santosh"],"propositions":[],"lastnames":["Vempala"],"suffixes":[]}],"title":"On the approximability of the traveling salesman problem (extended abstract)","booktitle":"Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA","pages":"126–133","year":"2000","crossref":"DBLP:conf/stoc/2000","url":"https://doi.org/10.1145/335305.335320","doi":"10.1145/335305.335320","timestamp":"Tue, 06 Nov 2018 00:00:00 +0100","biburl":"https://dblp.org/rec/bib/conf/stoc/PapadimitriouV00","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/stoc/PapadimitriouV00,\n author = {Christos H. Papadimitriou and\n Santosh Vempala},\n title = {On the approximability of the traveling salesman problem (extended\n abstract)},\n booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory\n of Computing, May 21-23, 2000, Portland, OR, {USA}},\n pages = {126--133},\n year = {2000},\n crossref = {DBLP:conf/stoc/2000},\n url = {https://doi.org/10.1145/335305.335320},\n doi = {10.1145/335305.335320},\n timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},\n biburl = {https://dblp.org/rec/bib/conf/stoc/PapadimitriouV00},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Papadimitriou, C. H.","Vempala, S."],"key":"DBLP:conf/stoc/PapadimitriouV00","id":"DBLP:conf/stoc/PapadimitriouV00","bibbaseid":"papadimitriou-vempala-ontheapproximabilityofthetravelingsalesmanproblemextendedabstract-2000","role":"author","urls":{"Paper":"https://doi.org/10.1145/335305.335320"},"downloads":0},"search_terms":["approximability","traveling","salesman","problem","extended","abstract","papadimitriou","vempala"],"keywords":[],"authorIDs":[],"dataSources":["o5MdET8K3qoMZxPKp"]}