23 citations · 84 across the 8 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018★ 23 cited
Finding k-Dissimilar Paths with Minimum Collective Length
Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper +2
Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough. In this paper, we st…
cs.DS2013★ 18 cited
Routing Directions: Keeping it Fast and Simple
Dimitris Sacharidis, Panagiotis Bouros
The problem of providing meaningful routing directions over road networks is of great importance. In many real-life cases, the fastest route may not be the ideal choice for providi…