COL-Trees: Efficient Hierarchical Object Search in Road Networks (Extended Abstract)
Proceedings of the International Symposium on Combinatorial Search · 14.08.2026 · 19 (1) · 292-293
DOI: 10.1609/socs.v19i1.43102 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the International Symposium on Combinatorial Search, online erschienen am 14.08.2026. Verfasst von Tenindra Abeywickrama und 2 weiteren Autor:innen.
Abstract (Originalsprache)
COL-Trees are a state-of-the-art data structure for hierarchical object search in road network graphs. While initially developed with multi-agent scenarios in mind, we show COL-Trees are highly suitable for single-agent queries as well, in particular, supporting upper-bound based k Farthest Neighbor search for the first time. Along with reducing pre-processing costs, we strengthen the case that COL-Trees are a highly versatile data structure with potential application to other problems by the combinatorial search community. To support such exploration, we also present a highly-optimized COL-Tree implementation as open-source for the first time.
Zitieren
APA
Abeywickrama, T., Cheema, M. A., & Storandt, S. (2026). COL-Trees: Efficient Hierarchical Object Search in Road Networks (Extended Abstract). Proceedings of the International Symposium on Combinatorial Search, 19(1), 292-293. https://doi.org/10.1609/socs.v19i1.43102
Vancouver
Abeywickrama T, Cheema MA, Storandt S. COL-Trees: Efficient Hierarchical Object Search in Road Networks (Extended Abstract). Proceedings of the International Symposium on Combinatorial Search. 2026;19(1):292-293. doi:10.1609/socs.v19i1.43102
BibTeX
@article{Abeywickrama2026,
author = {Abeywickrama, Tenindra and Cheema, Muhammad Aamir and Storandt, Sabine},
title = {COL-Trees: Efficient Hierarchical Object Search in Road Networks (Extended Abstract)},
journal = {Proceedings of the International Symposium on Combinatorial Search},
year = {2026},
volume = {19},
number = {1},
pages = {292--293},
doi = {10.1609/socs.v19i1.43102}
}
EUVIMED