"k-Nearest Neighbors on Road Networks: Euclidean Heuristic Revisited."

Tenindra Abeywickrama, Muhammad Aamir Cheema, David Taniar (2018)

> Home

Details and statistics

DOI: 10.1609/SOCS.V9I1.18443

access: open

type: Conference or Workshop Paper

metadata version: 2025-11-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/socs/AbeywickramaCT18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/socs/AbeywickramaCT18
Tenindra Abeywickrama, Muhammad Aamir Cheema, David Taniar:
k-Nearest Neighbors on Road Networks: Euclidean Heuristic Revisited. SOCS 2018: 184-185

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.