Efficient shortest path finding of k-nearest neighbor objects in road network databases

Sung-Hyun Shin, Sang-Chul Lee, Sang-Wook Kim, Junghoon Lee, Eul-Gyu Im. Efficient shortest path finding of k-nearest neighbor objects in road network databases. In Sung Y. Shin, Sascha Ossowski, Michael Schumacher, Mathew J. Palakal, Chih-Cheng Hung, editors, Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, March 22-26, 2010. pages 1661-1665, ACM, 2010. [doi]

@inproceedings{ShinLKLI10,
  title = {Efficient shortest path finding of k-nearest neighbor objects in road network databases},
  author = {Sung-Hyun Shin and Sang-Chul Lee and Sang-Wook Kim and Junghoon Lee and Eul-Gyu Im},
  year = {2010},
  doi = {10.1145/1774088.1774446},
  url = {http://doi.acm.org/10.1145/1774088.1774446},
  researchr = {https://researchr.org/publication/ShinLKLI10},
  cites = {0},
  citedby = {0},
  pages = {1661-1665},
  booktitle = {Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, March 22-26, 2010},
  editor = {Sung Y. Shin and Sascha Ossowski and Michael Schumacher and Mathew J. Palakal and Chih-Cheng Hung},
  publisher = {ACM},
  isbn = {978-1-60558-639-7},
}