Constrained Shortest Path Computation

This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequence of data points connecting s and d, such that the distance between any two consecutive points in the path is not great...

Full description

Saved in:
Bibliographic Details
Main Authors: TERROVITIS, Manolis, BAKIRAS, Spiridon, PAPADIAS, Dimitris, MOURATIDIS, Kyriakos
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2005
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/883
https://ink.library.smu.edu.sg/context/sis_research/article/1882/viewcontent/SSTD05_CSP.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English