The Shortest-Path Problem

Hector Ortega-Arranz, D. R. L., & Gonzalez-Escribano, A. (2015). The Shortest-Path Problem. Springer.

Type

Book chapter

Intellectual base

Review or monograph

Year

2015

DOI

10.1007/978-3-031-02574-7

Link

https://doi.org/10.1007/978-3-031-02574-7

Cited by

1 citation across 1 artifact.

Domain-specific

• Shortest path problem
  • Variants include single-pair, single-source, all-pairs, k-shortest, constrained, dynamic, stochastic and geometric problems; algorithm validity depends on negative weights, cycles, heuristics, graph representation and path-cost algebra.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:87ccbfa903ee · see in the full table