Donald C. S. Allison, Ritu Chadha. An O(N log N) expected time merge heuristic for the planar ETSP. In Arthur M. Riehl, editor, Computer Trends in the 1990s - Proceedings of the 1989 ACM 17th Annual Computer Science Conference, Louisville, Kentucky, USA, February 21-23, 1989. pages 472, ACM, 1989. [doi]
@inproceedings{AllisonC89,
title = {An O(N log N) expected time merge heuristic for the planar ETSP},
author = {Donald C. S. Allison and Ritu Chadha},
year = {1989},
doi = {10.1145/75427.1030303},
url = {http://doi.acm.org/10.1145/75427.1030303},
researchr = {https://researchr.org/publication/AllisonC89},
cites = {0},
citedby = {0},
pages = {472},
booktitle = {Computer Trends in the 1990s - Proceedings of the 1989 ACM 17th Annual Computer Science Conference, Louisville, Kentucky, USA, February 21-23, 1989},
editor = {Arthur M. Riehl},
publisher = {ACM},
isbn = {0-89791-299-3},
}