On the VC-dimension of unique round-trip shortest path systems

The VC-dimension, which has wide uses in learning theory, has been used in the analysis and design of graph algorithms recently. In this paper, we study the problem of bounding the VC-dimension of unique round-trip shortest path set systems (URTSP), which are set systems induced by sets of vertices in unique round-trip shortest paths in directed graphs. We first show that different from the VC-dimensions of set systems induced by unique undirected and directed shortest paths in undirected and directed graphs respectively, the VC-dimension of URTSP can be larger than 3. We then prove that the VC-dimension of URTSP is at most 32. Furthermore, we apply the VC-dimension result to the minimum k-round-trip shortest path cover problem (k-RTSPC), which is to find for a directed graph a minimum vertex set to intersect every round-trip shortest path containing at least k vertices, and derive an upper bound on the size of the vertex set. The k-RTSPC problem can be useful in many real-world applications, including optimal placement of facilities.

[1]  Mikkel Thorup,et al.  Roundtrip spanners and roundtrip routing in directed graphs , 2002, SODA '02.

[2]  Philip N. Klein,et al.  Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension , 2018, ESA.

[3]  Michael T. Goodrich,et al.  Almost optimal set covers in finite VC-dimension , 1995, Discret. Comput. Geom..

[4]  Andreas Emil Feldmann,et al.  Fixed-Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs , 2015, Algorithmica.

[5]  Stefan Funke,et al.  On k-Path Covers and their Applications , 2014, Proc. VLDB Endow..

[6]  Kenneth L. Clarkson,et al.  Algorithms for Polytope Covering and Approximation , 1993, WADS.

[7]  Kam-yiu Lam,et al.  Source-wise round-trip spanners , 2017, Inf. Process. Lett..

[8]  Christopher M. Hartman.  Extremal problems in graph theory , 1997 .

[9]  Kenneth L. Clarkson,et al.  A Las Vegas algorithm for linear programming when the dimension is small , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[10]  Amos Fiat,et al.  VC-Dimension and Shortest Path Algorithms , 2011, ICALP.

[11]  Dror Rawitz,et al.  Hitting sets when the VC-dimension is small , 2005, Inf. Process. Lett..

[12]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[13]  Jian Pei,et al.  On k-skip shortest paths , 2011, SIGMOD '11.

[14]  David P. Dobkin,et al.  On sparse spanners of weighted graphs , 1993, Discret. Comput. Geom..

[15]  Laurent Viennot,et al.  Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons , 2017, SODA.

[16]  Jochen Könemann,et al.  A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs , 2018, SIAM J. Comput..

[17]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[18]  Kam-yiu Lam,et al.  Deterministic improved round-trip spanners , 2018, Inf. Process. Lett..

[19]  Jon M. Kleinberg,et al.  Detecting a Network Failure , 2004, Internet Math..

[20]  Jakub W. Pachocki,et al.  Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners , 2016, SODA.

[21]  Amos Fiat,et al.  Highway dimension, shortest paths, and provably efficient algorithms , 2010, SODA '10.