Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets

Sandip Banerjee, Sujoy Bhore, Rajesh Chitnis. Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets. In Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro, editors, LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings. Volume 10807 of Lecture Notes in Computer Science, pages 80-93, Springer, 2018. [doi]

Abstract

Abstract is missing.