Instant approximate 1-center on road networks via embeddings

Authors:
Samidh Chatterjee;Bradley Neff;Piyush Kumar
Affiliations:
Florida State University, Tallahassee, FL;Florida State University, Tallahassee, FL;Florida State University, Tallahassee, FL
Venue:
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Year:
2011

Citing 9
Cited 1

An optimal algorithm for approximate nearest neighbor searching fixed dimensions

Journal of the ACM (JACM)
Linear Programming in Linear Time When the Dimension Is Fixed

Journal of the ACM (JACM)
Approximate minimum enclosing balls in high dimensions using core-sets

Journal of Experimental Algorithmics (JEA)
Aggregate Nearest Neighbor Queries in Road Networks

IEEE Transactions on Knowledge and Data Engineering
Local multidimensional scaling

Neural Networks - 2006 Special issue: Advances in self-organizing maps--WSOM'05
Computational Geometry: Algorithms and Applications

Computational Geometry: Algorithms and Applications
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds

IEEE Transactions on Visualization and Computer Graphics
Universal multi-dimensional scaling

Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Group Enclosing Queries

IEEE Transactions on Knowledge and Data Engineering

Fast k-clustering queries on embeddings of road networks

Proceedings of the 3rd International Conference on Computing for Geospatial Research and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the 1-center problem on road networks, an important problem in GIS. Using Euclidean embeddings, and reduction to fast nearest neighbor search, we devise an approximation algorithm for this problem. Our initial experiments on real world data sets indicate fast computation of constant factor approximate solutions for query sets much larger than previously computable using exact techniques.