The following pages present an extended abstract of a pre-vious publication at the 11th International Symposium on Experimental Algorithms (Luxen and Schieferdecker 2012). Introduction and Related Work Routing services have evolved over the past years. Providing only a shortest path is no longer enough. Users expect to be presented with a set of reasonable alternatives. We show how to engineer previous algorithms to provid
This paper proposes an algorithm to identify multiple alternative routes with the multi-label vine-b...
We propose a simple and effective heuristic that allows fast generation of a large set of shortest p...
We present fast and efficient algorithms for routing in road and public transit networks. An algorit...
We present a fast algorithm with preprocessing for computing multiple good alternative routes in roa...
Abstract. We study the problem of finding good alternative routes in road networks. We look for rout...
Every human likes choices. But today\u27s fast route planning algorithms usually compute just a sing...
Alternatives to a shortest path are a common feature for modern navigation providers. In contrast to...
We present improved methods for computing a set of alternative source-to-destination routes in road ...
20 pagesInternational audienceThe class of vehicle routing problems involves the optimization of fre...
Vehicle routing through road networks is an important topic of research: time and money can be saved...
We present a new method for computing a set of alternative origin-to-destination routes in road netw...
Computing the quickest route in a roadnetwork from a given source to a giventarget is an important p...
For some applications, e.g. route planning services, it is desirable to answer a point-to-point sho...
This dissertation examines advanced pre-processing techniques and query algorithms for efficiently s...
The authors carry out an experimental analysis of a number of shortest path (routing) algorithms inv...
This paper proposes an algorithm to identify multiple alternative routes with the multi-label vine-b...
We propose a simple and effective heuristic that allows fast generation of a large set of shortest p...
We present fast and efficient algorithms for routing in road and public transit networks. An algorit...
We present a fast algorithm with preprocessing for computing multiple good alternative routes in roa...
Abstract. We study the problem of finding good alternative routes in road networks. We look for rout...
Every human likes choices. But today\u27s fast route planning algorithms usually compute just a sing...
Alternatives to a shortest path are a common feature for modern navigation providers. In contrast to...
We present improved methods for computing a set of alternative source-to-destination routes in road ...
20 pagesInternational audienceThe class of vehicle routing problems involves the optimization of fre...
Vehicle routing through road networks is an important topic of research: time and money can be saved...
We present a new method for computing a set of alternative origin-to-destination routes in road netw...
Computing the quickest route in a roadnetwork from a given source to a giventarget is an important p...
For some applications, e.g. route planning services, it is desirable to answer a point-to-point sho...
This dissertation examines advanced pre-processing techniques and query algorithms for efficiently s...
The authors carry out an experimental analysis of a number of shortest path (routing) algorithms inv...
This paper proposes an algorithm to identify multiple alternative routes with the multi-label vine-b...
We propose a simple and effective heuristic that allows fast generation of a large set of shortest p...
We present fast and efficient algorithms for routing in road and public transit networks. An algorit...
DOI
Add to ORKG