Designing Efficient and Reachable Routes: The $k$-Step-Central Shortest Path Problem

Abstract: Designing rapid transportation routes requires balancing efficiency and reachability. Shortest-path models ensure direct, cost-efficient routes but ignore coverage, while centrality-based approaches maximize accessibility but do not enforce operational constraints. We study the problem of selecting a shortest path that maximizes reachability, measured as the number of nodes within a fixed distance of the path. To do this, we introduce the $k$-Step-Central Shortest Path problem and analyse its structural properties. We show that optimal solutions on unweighted graphs can be found in polynomial time and propose an algorithm with a novel pruning rule. We also prove that the problem becomes NP-hard when edge weights are introduced. Additionally, we show that our algorithm can be used to solve the NP-hard problem of finding the closeness-central shortest path in a graph. We demonstrate the efficiency and scalability of our algorithm on synthetic and real-world networks with up to 2,000 nodes. Our results show that improving reachability can substitute for route expansion: increasing the reach of transit lines drastically increases their coverage with shorter routes. This suggests that investments in active transport infrastructure that improve reachability can be more effective than extending primary routes, providing a data-driven basis for allocating resources in network design.

• The paper introduces a model that selects shortest paths with maximal k-step reach centrality to balance efficiency and network coverage.
• It employs dynamic programming with pruning based on 2k-node suffixes, ensuring polynomial-time solvability for unweighted graphs.
• Empirical experiments demonstrate that increasing k leads to shorter paths with superlinear increases in neighborhood coverage, benefiting urban transit planning.

The $k$-Step-Central Shortest Path Problem: Balancing Efficiency and Reachability in Route Selection

Problem Formulation and Motivation

The paper addresses the fundamental network optimization problem of selecting a shortest path that, while minimizing travel cost or distance, also maximizes the $k$-step reach centrality—that is, the number of nodes within $k$ hops of the selected path. This problem abstracts a key tension in rapid transportation and network design: optimizing both directness (efficiency) and network coverage (reachability/adoption). Traditional shortest path models provide cost-efficient solutions but frequently exhibit minimal coverage, while maximum centrality approaches may lead to circuitous or operationally infeasible routes. By restricting attention to shortest paths and employing $k$-step reach centrality, the authors develop a model directly parameterizing the critical trade-off between rapidity and coverage, where $k$ controls the emphasis on local versus global accessibility.

The model is motivated primarily by network design in urban transit and related applications, including logistics, communication, and surveillance or intervention strategies. It extends naturally to last-mile facility location, maximizing message propagation in social networks, and other combinatorial settings where operational constraints require solutions to be paths with maximal reach per hop constraint.

Structural Results and Algorithmic Contributions

The authors provide a detailed complexity analysis of the $k$-step-central shortest path (kStep-CSP) problem. For unweighted graphs, they establish that the problem is polynomial-time solvable for any fixed $k$, utilizing structural properties of shortest paths in the context of group centrality measures. Core to the approach is the observation that, under the $k$-step centrality metric, many extensions of partial paths can be pruned during enumeration due to isomorphism in their terminal segments—specifically, only the most central path for each unique $2k$-node suffix needs to be retained.

The central result—an algorithm with complexity $O(m|V|^{2k+4})$ (with $k$0 the graph diameter)—uses a dynamic programming paradigm augmented with pruning rules derived from the neighborhood disjointness lemmas. This restricts otherwise exponentially-growing path extensions, making computation feasible on realistic networks. The correctness and tractability of the algorithm rest on careful analysis of how $k$1-step neighborhoods of path segments interact as paths are extended.

The following sequence of figures illustrate the salient structural properties and behaviors for various instances and parameter choices:

Figure 2: Example $k$2-step-central shortest path with $k$3 and $k$4 on London urban street network.

Figure 4: For $k$5, $k$6, $k$7 in the San Francisco grid, with the optimal path strongly centralized spatially.

Figure 6: In Savannah, $k$8 yields $k$9, $k$0, further emphasizing the effect of topology on reach.

Figure 8: Barcelona instance, $k$1, $k$2, $k$3, supporting rapid coverage with compact paths.

Figure 10: Irvine1 (small tree-structured network), $k$4, $k$5, $k$6, underscoring limitations of tree topologies for coverage even with direct routing.

Figure 1: Irvine2 (medium-size network), $k$7, $k$8, $k$9, demonstrating the method's applicability even with increased network size and complexity.

Figure 3: Los Angeles network, $k$0, $k$1, $k$2, showing interplay of grid elements and main corridors for maximal reach.

Figure 5: New York network, $k$3, $k$4, $k$5, showcasing the effect of Manhattan's urban grid.

Figure 15: Paris, $k$6, $k$7, $k$8, path embedding in the radial-natural layout.

Figure 17: Walnut Creek, $k$9, $k$0, $k$1, illustrating the impact of moderate-size planar road networks.

Figure 7: Washington, $k$2, $k$3, $k$4, showing centralized routing in a government-planned topology.

Complexity in Weighted Graphs

The computational landscape exhibits a dichotomy: Introducing edge weights renders the problem NP-hard, with the hardness shown via a reduction from SAT to the decision version of kStep-CSP on weighted graphs. The reduction exploits the flexibility in interleaving clauses and variables, encoding feasible assignments via shortest paths. Furthermore, it is shown that the algorithm developed for the unweighted case cannot be extended to general weighted graphs unless P=NP.

This complexity transition aligns with previously established hardness results when group centrality and combinatorial structures are intertwined—see closely related work on the minimum vertex cover, $k$5-center, and covering path problems [PhosavanhMatsypura2025]. The result situates the $k$6-step-central shortest path problem squarely within the class of computationally challenging facility location and coverage problems, generalizing beyond degree or betweenness-centric variants.

Numerical Experiments and Empirical Insights

The algorithm's practical scalability and versatility are demonstrated on synthetic graph classes (Watts-Strogatz, Barabási-Albert) and real-world urban street networks up to 2,000 nodes. Experimental results corroborate the anticipated linear-in-$k$7 trade-off: As $k$8 increases, the size of the covered neighborhood grows superlinearly, allowing substantial coverage improvements with equivalent or reduced path lengths. This is empirically validated through both centrality measures and run-time analyses.

Several clear operational findings emerge:

• Path length contraction with increased $k$9: As the reachability parameter $k$0 grows, optimal paths become shorter yet cover substantially more of the network.
• Drastic coverage increase: Doubling $k$1 can more than double the covered neighborhood, highlighting the efficiency of improving local accessibility versus lengthening main corridors.
• Topological influence: In lattice-like or highly meshed networks, the combinatorial explosion of shortest paths is mitigated via the described pruning algorithm. Figure-based analyses suggest that the optimal path's structure and location vary with $k$2 and underlying network topology.

These results have direct consequences for transit network and facility planning. Investments focused on improving local accessibility (e.g., secondary, active-transport infrastructure) yield a higher marginal gain in total network coverage per unit of mainline extension than further expanding route length.

Connection to Closeness Centrality and Further Extensions

A methodological extension shows that the algorithm for $k$3-step-central shortest paths yields an exact solution to the closeness-central shortest path problem (minimizing the maximum node distance to any path node). This connection emerges as $k$4 increases—the $k$5-step centrality approaches a global, closeness-like property. Thus, iterative application for increasing $k$6 efficiently bounds the optimal path eccentricity.

This unification under the group-centrality framework suggests algorithmic generalizations beyond degree-centric measures to other centrality-driven path selection problems, with tractability conditioned on semantical graph properties (e.g., absence of edge weights, bounded diameter).

Implications and Future Directions

The paper’s framework provides a rigorous, scalable method for multi-objective network design—reconciling coverage and efficiency—backed by both theoretical guarantees and empirical demonstration. The formalization of the $k$7-step-central shortest path problem and the associated pruning-enabled dynamic algorithm represent a significant advance in applicability for operational research, particularly for urban systems, logistics, and communication network planning.

Potential avenues for expansion include:

• The development of integer programming and heuristic approximation algorithms suitable for weighted or very large-scale graphs where $k$8 and network diameter may still pose computational barriers.
• Incorporation of node or edge weights reflecting demand, cost, or topographical constraints, to further modulate the coverage–efficiency trade-off.
• The analysis of online and incremental variants for dynamic or evolving networks.
• Broader integration with multimodal accessibility frameworks and multi-layer networks.

Conclusion

This work systematically elucidates the design space for direct yet highly reachable network routings, formalizing and solving the $k$9-step-central shortest path problem in unweighted graphs and charting the boundaries of polynomial-time solvability. The integration of centrality measures, practical network design imperatives, and algorithmic efficiency positions this approach as a foundation for data-driven resource allocation and infrastructure planning. The results serve both as a decision-theoretic tool and as a theoretical bridge across centrality-optimized routing and classical facility location, with algorithms and empirical findings that are readily extensible to further optimization and AI network design research.

Reference: "Designing Efficient and Reachable Routes: The $k$0-Step-Central Shortest Path Problem" (2606.14128).