To Meet or Not to Meet: Finding the Shortest Paths in Road Networks

Finding the shortest path in road networks becomes one of important issues in location based services (LBS). The problem of finding the optimal meeting point for a group of users has also been well studied in existing works. In this paper, we investigate a new problem for two users. Each user has hi...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on knowledge and data engineering Jg. 30; H. 4; S. 772 - 785
Hauptverfasser:	Weihuang Huang, Yikai Zhang, Zechao Shang, Yu, Jeffrey Xu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.04.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Approximation algorithms Bridges Companies Enumeration Location based services meeting requirement Production planning Pruning Roads Shortest path problem Shortest paths Shortest-path problems Steiner trees Uncertainty Weight
ISSN:	1041-4347, 1558-2191
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!