On the approximability of the traveling salesman problem (extended abstract). Papadimitriou, C. H. and Vempala, S. In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA, pages 126–133, 2000.
On the approximability of the traveling salesman problem (extended abstract) [link]Paper  doi  bibtex   
@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}
}
Downloads: 0