Constrained Shortest Path and Hierarchical Structures

Adil Erzin, Roman Plotnikov, Ilya Ladygin

The Constraint Shortest Path (CSP) problem is as follows. An $n$-vertex graph is given, each edge/arc assigned two weights. Let us call them "cost" and "length" for definiteness. F…