Conceptio › Archive › arXiv (OAI Expanded)
arXiv (OAI Expanded)open access

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

Phosavanh, Johnson et al.
arXiv (OAI Expanded) · Papers · License: Open Access
Open Source ↗Direct PDF ↓
combinatoricsdata-structures-and-algorithmsoptimization-and-control
data structures and algorithms, combinatorics, optimization and control
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗

Related documents

Record · ID 668569
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.