Frank Schulz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Frank Schulz has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
Dorothea Wagner
Karlsruhe Institute of Technology (KIT)
12 shared publications- Christos Zaroliagis
University of Patras
3 shared publications Martin Holzer
KIT, Universität Karlsruhe (TH), Karlsruhe, Germany
3 shared publicationsThomas Willhalm
Universität Karlsruhe, Karlsruhe, Germany
3 shared publicationsKarsten Weihe
Univ. Konstanz
2 shared publicationsUlrik Brandes
University of Konstanz, Konstanz, Germany
2 shared publications
Latest Publications
- 27 September 2017
- Published by Springer Nature
- p. 110-126
Time-Dependent Route Planning for Truck Drivers
- 27 September 2017
- Published by Springer Nature
- p. 110-126
Time-Dependent Route Planning for Truck Drivers
- Open Access
- 23 February 2009
- Published by Association for Computing Machinery (ACM) in ACM Journal of Experimental Algorithmics
- Vol. 13
Engineering multilevel overlay graphs for shortest-path queries
An overlay graph of a given graph G = ( V , E ) on a subset S ⊆ V is a graph with vertex set S and edges corresponding to shortest paths in G . In particular, we consider variations of the multilevel overlay graph used in Schulz et al. [2002] to speed up shortest-path computation. In this work, we follow up and present several vertex selection criteria, along with two general strategies of applying these criteria, to determine a subset S of a graph's vertices. The main contribution is a systematic experimental study where we investigate the impact of selection criteria and strategies on multilevel overlay graphs and the resulting speed-up achieved for shortest-path computation: Depending on selection strategy and graph type, a centrality index criterion, selection based on planar separators, and vertex degree turned out to perform best.
- 23 February 2009
- Published by Association for Computing Machinery (ACM) in ACM Journal of Experimental Algorithmics
- Vol. 13
Open AccessEngineering multilevel overlay graphs for shortest-path queries
An overlay graph of a given graph G = ( V , E ) on a subset S ⊆ V is a graph with vertex set S and edges corresponding to shortest paths in G . In particular, we consider variations of the multilevel overlay graph used in Schulz et al. [2002] to speed up shortest-path computation. In this work, we follow up and present several vertex selection criteria, along with two general strategies of applying these criteria, to determine a subset S of a graph's vertices. The main contribution is a systematic experimental study where we investigate the impact of selection criteria and strategies on multilevel overlay graphs and the resulting speed-up achieved for shortest-path computation: Depending on selection strategy and graph type, a centrality index criterion, selection based on planar separators, and vertex degree turned out to perform best.
- 6 January 2007
- Published by Society for Industrial & Applied Mathematics (SIAM)
- p. 36-45
Computing Many-to-Many Shortest Paths Using Highway Hierarchies
- 6 January 2007
- Published by Society for Industrial & Applied Mathematics (SIAM)
- p. 36-45
Computing Many-to-Many Shortest Paths Using Highway Hierarchies
- Open Access
- 31 December 2005
- Published by Association for Computing Machinery (ACM) in ACM Journal of Experimental Algorithmics
- Vol. 10
Combining speed-up techniques for shortest-path computations
In practice, computing a shortest path from one node to another in a directed graph is a very common task. This problem is classically solved by Dijkstra's algorithm. Many techniques are known to speed up this algorithm heuristically, while optimality of the solution can still be guaranteed. In most studies, such techniques are considered individually. The focus of our work is combination of speed-up techniques for Dijkstra's algorithm. We consider all possible combinations of four known techniques, namely, goal-directed search , bidirectional search , multilevel approach , and shortest-path containers , and show how these can be implemented. In an extensive experimental study, we compare the performance of the various combinations and analyze how the techniques harmonize when jointly applied. Several real-world graphs from road maps and public transport and three types of generated random graphs are taken into account.
- 31 December 2005
- Published by Association for Computing Machinery (ACM) in ACM Journal of Experimental Algorithmics
- Vol. 10
Open AccessCombining speed-up techniques for shortest-path computations
In practice, computing a shortest path from one node to another in a directed graph is a very common task. This problem is classically solved by Dijkstra's algorithm. Many techniques are known to speed up this algorithm heuristically, while optimality of the solution can still be guaranteed. In most studies, such techniques are considered individually. The focus of our work is combination of speed-up techniques for Dijkstra's algorithm. We consider all possible combinations of four known techniques, namely, goal-directed search , bidirectional search , multilevel approach , and shortest-path containers , and show how these can be implemented. In an extensive experimental study, we compare the performance of the various combinations and analyze how the techniques harmonize when jointly applied. Several real-world graphs from road maps and public transport and three types of generated random graphs are taken into account.
- 1 January 2005
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 628-639
Engineering Planar Separator Algorithms
- 1 January 2005
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 628-639
Engineering Planar Separator Algorithms
- Open Access
- 31 December 2004
- Published by Association for Computing Machinery (ACM) in ACM Journal of Experimental Algorithmics
- Vol. 9
Generating node coordinates for shortest-path computations in transportation networks
Speed-up techniques that exploit given node coordinates have proven useful for shortest-path computations in transportation networks and geographic information systems. To facilitate the use of such techniques when coordinates are missing from some, or even all, of the nodes in a network we generate artificial coordinates using methods from graph drawing. Experiments on a large set of German train timetables indicate that the speed-up achieved with coordinates from our drawings is close to that achieved with the true coordinates---and in some special cases even better.
- 31 December 2004
- Published by Association for Computing Machinery (ACM) in ACM Journal of Experimental Algorithmics
- Vol. 9
Open AccessGenerating node coordinates for shortest-path computations in transportation networks
Speed-up techniques that exploit given node coordinates have proven useful for shortest-path computations in transportation networks and geographic information systems. To facilitate the use of such techniques when coordinates are missing from some, or even all, of the nodes in a network we generate artificial coordinates using methods from graph drawing. Experiments on a large set of German train timetables indicate that the speed-up achieved with coordinates from our drawings is close to that achieved with the true coordinates---and in some special cases even better.
- Open Access
- 1 February 2004
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 92, 85-103
Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach
- 1 February 2004
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 92, 85-103
Open AccessTowards Realistic Modeling of Time-Table Information through the Time-Dependent Approach