Michael J. Collins. Covering a Set of Points with a Minimum Number of Turns. In Tandy Warnow, Binhai Zhu, editors, Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings. Volume 2697 of Lecture Notes in Computer Science, pages 467-474, Springer, 2003. [doi]
@inproceedings{Collins03:2,
title = {Covering a Set of Points with a Minimum Number of Turns},
author = {Michael J. Collins},
year = {2003},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2697&spage=467},
researchr = {https://researchr.org/publication/Collins03%3A2},
cites = {0},
citedby = {0},
pages = {467-474},
booktitle = {Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings},
editor = {Tandy Warnow and Binhai Zhu},
volume = {2697},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-40534-8},
}