Blum, Johannes

Johannes Blum, M. Sc.

Link zu meiner neuen Seite an der Universität Konstanz

Lehrstuhl für Informatik I
Am Hubland
Universität Würzburg
D-97070 Würzburg

Raum: E26

Telefon: +49 931 31-86382

Email: johannes.blum@uni-wuerzburg.de

Lehrveranstaltungen

SS 2018: Übungen zu Theoretische Informatik
WS 2017/2018: Übungen zu Algorithmen und Datenstrukturen
SS 2017: Übungen zu Theoretische Informatik
WS 2016/2017: Übungen zu Algorithmen und Datenstrukturen

Werdegang

seit Oktober 2016:
Wissenschaftlicher Mitarbeiter am Lehrstuhl für Informatik I, Universität Würzburg
Oktober 2015 - September 2017:
Master Informatik an der Universität Würzburg
Preis des Instituts für Informatik für herausragende Leistungen im Studiengang Informatik
September 2013 - Juni 2017:
Master Informatik an der Universität Umeå
Oktober 2011 - August 2013:
Bachelor Informatik an der Universität Würzburg
Auslandssemester an der Blekinge Tekniska Högskola

Veröffentlichungen

2018[ to top ]

Computation and Growth of Road Network Dimensions. Blum, Johannes; Storandt, Sabine. In COCOON, Bd. 10976 von Lecture Notes in Computer Science, L. Wang, D. Zhu (Hrsg.), S. 230–241. Springer, 2018.
- [ Abstract ]
- [ BibTeX ]
- [ URL ]
There is a plethora of route planning techniques which work remarkably well on real-world road networks. To explain their good performance, theoretical bounds in dependency of road network parameters as the highway dimension $$h$$ or the skeleton dimension $$k$$ were investigated. For example, for the hub label technique, query times in the order of $$\mathcal{O}(p \log D)$$ and a space consumption of $$\mathcal{O}(np \log D)$$ were proven for both $$p=h$$ and $$p=k$$, with $$D$$ denoting the graph diameter and $$n$$ the number of nodes in the network. But these bounds are only meaningful when the dimension values $$h$$ or $$k$$ are known. While it was conjectured that $$h$$ and $$k$$ grow polylogarithmically in $$n$$, their true nature was not thoroughly investigated before -- primarily because of a lack of efficient algorithms for their computation. For the highway dimension, this is especially challenging as it is NP-hard to decide whether a network has highway dimension at most $$h$$. We describe the first efficient algorithms to lower bound the highway dimension and to compute the skeleton dimension exactly, even in huge networks. This allows us to formulate new conjectures about their growth behavior. Somewhat surprisingly, our results imply that $$h$$ and $$k$$ scale very differently. While $$k$$ turns out to be a constant, we expect $$h$$ to grow superpolylogarithmically in $$n$$. These observations have implications for the future design and analysis of route planning techniques.

@inproceedings{conf/cocoon/BlumStorandt18, abstract = {There is a plethora of route planning techniques which work remarkably well on real-world road networks. To explain their good performance, theoretical bounds in dependency of road network parameters as the highway dimension $h$ or the skeleton dimension $k$ were investigated. For example, for the hub label technique, query times in the order of $\mathcal{O}(p \log D)$ and a space consumption of $\mathcal{O}(np \log D)$ were proven for both $p=h$ and $p=k$, with $D$ denoting the graph diameter and $n$ the number of nodes in the network. But these bounds are only meaningful when the dimension values $h$ or $k$ are known. While it was conjectured that $h$ and $k$ grow polylogarithmically in $n$, their true nature was not thoroughly investigated before – primarily because of a lack of efficient algorithms for their computation. For the highway dimension, this is especially challenging as it is NP-hard to decide whether a network has highway dimension at most $h$. We describe the first efficient algorithms to lower bound the highway dimension and to compute the skeleton dimension exactly, even in huge networks. This allows us to formulate new conjectures about their growth behavior. Somewhat surprisingly, our results imply that $h$ and $k$ scale very differently. While $k$ turns out to be a constant, we expect $h$ to grow superpolylogarithmically in $n$. These observations have implications for the future design and analysis of route planning techniques.}, author = {Blum, Johannes and Storandt, Sabine}, booktitle = {COCOON}, editor = {Wang, Lusheng and Zhu, Daming}, keywords = {myown}, pages = {230-241}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Computation and Growth of Road Network Dimensions}, volume = 10976, year = 2018 }
Sublinear Search Spaces for Shortest Path Planning in Grid and Road Networks. Blum, Johannes; Funke, Stefan; Storandt, Sabine. In AAAI, S. McIlraith, K. Weinberger (Hrsg.), S. 6119–6126. AAAI Press, 2018.
- [ Abstract ]
- [ BibTeX ]
- [ URL ]
Shortest path planning is a fundamental building block in many applications. Hence developing efficient methods for computing shortest paths in e.g. road or grid networks is an important challenge. The most successful techniques for fast query answering rely on preprocessing. But for many of these techniques it is not fully understood why they perform so remarkably well and theoretical justification for the empirical results is missing. An attempt to explain the excellent practical performance of preprocessing based techniques on road networks (as transit nodes, hub labels, or contraction hierarchies) in a sound theoretical way are parametrized analyses, e.g., considering the highway dimension or skeleton dimension of a graph. But these parameters tend to be large (order of $$\Theta(\sqrt n)$$) when the network contains grid-like substructures -- which inarguably is the case for real-world road networks around the globe. In this paper, we use the very intuitive notion of bounded growth graphs to describe road networks and also grid graphs. We show that this model suffices to prove sublinear search spaces for the three above mentioned state-of-the-art shortest path planning techniques. For graphs with a large highway or skeleton dimension, our results turn out to be superior. Furthermore, our preprocessing methods are close to the ones used in practice and only require randomized polynomial time.

@inproceedings{conf/aaai/BlumFunkeStorandt18, abstract = {Shortest path planning is a fundamental building block in many applications. Hence developing efficient methods for computing shortest paths in e.g. road or grid networks is an important challenge. The most successful techniques for fast query answering rely on preprocessing. But for many of these techniques it is not fully understood why they perform so remarkably well and theoretical justification for the empirical results is missing. An attempt to explain the excellent practical performance of preprocessing based techniques on road networks (as transit nodes, hub labels, or contraction hierarchies) in a sound theoretical way are parametrized analyses, e.g., considering the highway dimension or skeleton dimension of a graph. But these parameters tend to be large (order of $\Theta(\sqrt n)$) when the network contains grid-like substructures – which inarguably is the case for real-world road networks around the globe. In this paper, we use the very intuitive notion of bounded growth graphs to describe road networks and also grid graphs. We show that this model suffices to prove sublinear search spaces for the three above mentioned state-of-the-art shortest path planning techniques. For graphs with a large highway or skeleton dimension, our results turn out to be superior. Furthermore, our preprocessing methods are close to the ones used in practice and only require randomized polynomial time.}, author = {Blum, Johannes and Funke, Stefan and Storandt, Sabine}, booktitle = {AAAI}, editor = {McIlraith, Sheila and Weinberger, Kilian}, keywords = {myown}, pages = {6119-6126}, publisher = {AAAI Press}, title = {Sublinear Search Spaces for Shortest Path Planning in Grid and Road Networks}, year = 2018 }
Scalability of Route Planning Techniques. Blum, Johannes; Storandt, Sabine. In ICAPS, M. de Weerdt, S. Koenig, G. Röger, M. Spaan (Hrsg.). AAAI Press, 2018.
- [ Abstract ]
- [ BibTeX ]
- [ URL ]
In this paper, we thoroughly analyze the scaling behavior of several state-of-the-art route planning techniques for road networks, all of which rely on preprocessing. One goal is to determine which technique is most suitable to be used on huge networks. To be able to conduct scalability studies in a clean way, we first describe a new kind of road network generator that allows to produce road networks even larger than that of our planet with similar properties as real networks. We then carefully implement several preprocessing-based route planning techniques, as contraction hierarchies, hub labels and transit nodes, to study their space consumption as well as their search spaces in different sized networks. This allows to derive functions that describe their empirical scaling behavior for the first time. We also compare our functions to existing theoretical bounds. We show that several of our results can not be sufficiently explained by the theoretical investigations conducted so far. Hence our results encourage a further look for road network models that allow for better predictions.

@inproceedings{conf/icaps/BlumStorandt18, abstract = {In this paper, we thoroughly analyze the scaling behavior of several state-of-the-art route planning techniques for road networks, all of which rely on preprocessing. One goal is to determine which technique is most suitable to be used on huge networks. To be able to conduct scalability studies in a clean way, we first describe a new kind of road network generator that allows to produce road networks even larger than that of our planet with similar properties as real networks. We then carefully implement several preprocessing-based route planning techniques, as contraction hierarchies, hub labels and transit nodes, to study their space consumption as well as their search spaces in different sized networks. This allows to derive functions that describe their empirical scaling behavior for the first time. We also compare our functions to existing theoretical bounds. We show that several of our results can not be sufficiently explained by the theoretical investigations conducted so far. Hence our results encourage a further look for road network models that allow for better predictions.}, author = {Blum, Johannes and Storandt, Sabine}, booktitle = {ICAPS}, editor = {de Weerdt, Mathijs and Koenig, Sven and Röger, Gabriele and Spaan, Matthijs}, keywords = {myown}, publisher = {AAAI Press}, title = {Scalability of Route Planning Techniques}, year = 2018 }

2016[ to top ]

Properties of Regular DAG Languages. Blum, Johannes; Drewes, Frank. In LATA, Bd. 9618 von Lecture Notes in Computer Science, A.-H. Dediu, J. Janousek, C. Martín-Vide, B. Truthe (Hrsg.), S. 427–438. Springer, 2016.
- [ Abstract ]
- [ BibTeX ]
- [ URL ]
A DAG is a directed acyclic graph. We study the properties of DAG automata and their languages, called regular DAG languages. In particular, we prove results resembling pumping lemmas and show that the finiteness problem for regular DAG languages is in P.

@inproceedings{conf/lata/BlumD16, abstract = {A DAG is a directed acyclic graph. We study the properties of DAG automata and their languages, called regular DAG languages. In particular, we prove results resembling pumping lemmas and show that the finiteness problem for regular DAG languages is in P.}, author = {Blum, Johannes and Drewes, Frank}, booktitle = {LATA}, crossref = {conf/lata/2016}, editor = {Dediu, Adrian-Horia and Janousek, Jan and Martín-Vide, Carlos and Truthe, Bianca}, keywords = {myown}, pages = {427-438}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Properties of Regular DAG Languages.}, volume = 9618, year = 2016 }

Johannes Blum, M. Sc.

Link zu meiner neuen Seite an der Universität Konstanz

Lehrveranstaltungen

Werdegang

Veröffentlichungen

Hinweis zum Datenschutz

Hinweis zum Datenschutz

Bildnachweise