Colored range closest-pair problem under general distance functions

DOI10.1137/1.9781611975482.24zbMath1431.68020arXiv1807.09977OpenAlexW2951932983MaRDI QIDQ5236205

No author found.

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.09977

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items (3)

New bounds for range closest-pair problems ⋮ Approximate range closest-pair queries ⋮ Range closest-pair search in higher dimensions

This page was built for publication: Colored range closest-pair problem under general distance functions