arXiv (OAI)open access
Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse
computational complexity
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 183145
Conceptio Open Knowledge Archive — every document is proof-bundled with source, license, and retrieval metadata.