Approximate TSP in Graphs with Forbidden Minors

Michelangelo Grigni. Approximate TSP in Graphs with Forbidden Minors. In Ugo Montanari, José D. P. Rolim, Emo Welzl, editors, Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings. Volume 1853 of Lecture Notes in Computer Science, pages 869-877, Springer, 2000. [doi]

@inproceedings{Grigni00,
  title = {Approximate TSP in Graphs with Forbidden Minors},
  author = {Michelangelo Grigni},
  year = {2000},
  url = {http://link.springer.de/link/service/series/0558/bibs/1853/18530869.htm},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Grigni00},
  cites = {0},
  citedby = {0},
  pages = {869-877},
  booktitle = {Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
  editor = {Ugo Montanari and José D. P. Rolim and Emo Welzl},
  volume = {1853},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-67715-1},
}