Approximation Algorithms for the Minimum Bends Traveling Salesman Problem

Clifford Stein, David P. Wagner. Approximation Algorithms for the Minimum Bends Traveling Salesman Problem. In Karen Aardal, Bert Gerards, editors, Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings. Volume 2081 of Lecture Notes in Computer Science, pages 406-422, Springer, 2001. [doi]

@inproceedings{SteinW01,
  title = {Approximation Algorithms for the Minimum Bends Traveling Salesman Problem},
  author = {Clifford Stein and David P. Wagner},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2081/20810406.htm},
  researchr = {https://researchr.org/publication/SteinW01},
  cites = {0},
  citedby = {0},
  pages = {406-422},
  booktitle = {Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
  editor = {Karen Aardal and Bert Gerards},
  volume = {2081},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-42225-0},
}