Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
VC-Dimension and Shortest Path Algorithms

Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, and Renato F. Werneck


We explore the relationship between VC-dimension and graph algorithm design. In particular, we show that set systems induced by sets of vertices on shortest paths have VC-dimension at most two. This allows us to use a result from learning theory to improve time bounds on query algorithms for the point-to-point shortest path problem in networks of low highway dimension, such as road networks. We also refine the definitions of highway dimension and related concepts, making them more general and potentially more relevant to practice. In particular, we define highway dimension in terms of set systems induced by shortest paths, and give cardinality-based and average case definitions.


Publication typeInproceedings
Published inProc. ICALP 2011
PublisherSpringer Verlag
> Publications > VC-Dimension and Shortest Path Algorithms