Publications with Alon Efrat
Applications of nearest-neighbor chains: Euclidean TSP and motorcycle graphs.
N. Mamano,
A. Efrat,
D. Eppstein,
D. Frishberg,
M. T. Goodrich, and
S. G. Kobourov,
P. Matias, and
V. Polishchuk.
arXiv:1902.06875.
Computational Geometry: Young Researchers Forum, 2019.
Proc. 30th International Symposium on Algorithms and Computation
(ISAAC 2019), Shanghai, China, 2019.
Leibniz International
Proceedings in Informatics (LIPIcs) 149, 2019, pp. 51:1–51:21.
We apply the nearest-neighbor chain algorithm to repeatedly find pairs of mutual nearest neighbors for different distances, speeding up the times for the multi-fragment TSP heuristic, motorcycle graphs, straight skeletons, and other problems.