Frank Schulz

Frank Schulz

Auto-generated profile, based on publicly available information

Frank Schulz

University of Konstanz

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 December 2000 in ACM Journal of Experimental Algorithmics
Verified
Journal Article
Open access
FSFrank Schulz
Frank Schulz
DWDorothea Wagner
Dorothea Wagner
KWKarsten Weihe
Karsten Weihe
Traffic information systems are among the most prominent real-world applications of Dijkstra's algorithm for shortest paths. We consider the scenario of a central information server in the realm of public railroad transport on wide-area networks. Such a system has to process a large number of on-line queries for optimal travel connections in real time. In practice, this problem is usually solved by heuristic variations of Dijkstra's algorithm, which do not guarantee an optimal result. We report results from a pilot study, in which we focused on the travel time as the only optimization criterion. In this study, various speed-up techniques for Dijkstra's algorithm were analysed empirically. This analysis was based on the timetable data of all German trains and on a "snapshot" of half a million customer queries.

12 July 2002 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
FSFrank Schulz
Frank Schulz
DWDorothea Wagner
Dorothea Wagner
CZChristos Zaroliagis
Christos Zaroliagis

14 September 2007
Verified
Book Chapter
Closed access
PDF file
MMMatthias Müller-Hannemann
Matthias Müller-Hannemann
FSFrank Schulz
Frank Schulz
DWDorothea Wagner
Dorothea Wagner
CZChristos Zaroliagis
Christos Zaroliagis

6 January 2007
Verified
Book Chapter
Closed access
SKSebastian Knopp
Sebastian Knopp
PSPeter Sanders
Peter Sanders
DSDominik Schultes
Dominik Schultes
FSFrank Schulz
Frank Schulz
DWDorothea Wagner
Dorothea Wagner

23 February 2009 in ACM Journal of Experimental Algorithmics
Verified
Journal Article
Open access
MHMartin Holzer
Martin Holzer
FSFrank Schulz
Frank Schulz
DWDorothea Wagner
Dorothea Wagner
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.

1 January 1999
Verified
Book Chapter
Closed access
PDF file
FSFrank Schulz
Frank Schulz
DWDorothea Wagner
Dorothea Wagner
KWKarsten Weihe
Karsten Weihe