Engineering label-constrained shortest-path algorithms

MaRDI QIDQ3574272zbMATH OpenFDO

Authors Keith R. Bisset, Martin Holzer, Goran Konjevod, Dorothea Wagner, Chris L. Barrett, Madhav V. Marathe

Publication date 9 July 2010

zbMATH Keywords

speed-up techniques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Programming involving graphs or networks (90C35)

Recommendations

• Engineering Label-Constrained Shortest-Path Algorithms
• Formal-Language-Constrained Path Problems
• On the Complexity of Universality for Partially Ordered NFAs
• Formal language constrained path problems
• UniALT for regular language contrained shortest paths on a multi-modal transportation network

Cited in

(9)

• Finding the shortest path with vertex constraint over large graphs
• User-constrained multimodal route planning
• UniALT for regular language contrained shortest paths on a multi-modal transportation network
• Engineering Label-Constrained Shortest-Path Algorithms
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• Formal-Language-Constrained Path Problems
• Constrained route planning based on the regular expression
• Formal language constrained path problems
• Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks

This page was built for publication: Engineering label-constrained shortest-path algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3574272)