On finding shortest paths in arc-dependent networks

DOI10.1007/978-3-030-53262-8_21zbMath1458.90628OpenAlexW3044696671MaRDI QIDQ2225067

Matthew Williamson, K. Subramani and Vahan Mkrtchyan, Piotr J. Wojciechowski

Publication date: 4 February 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-53262-8_21

zbMATH Keywords

simple paths, NP-complete, negative cost cycles

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (4)

Analyzing the reachability problem in choice networks ⋮ On the analysis of optimization problems in arc-dependent networks ⋮ On the approximability of path and cycle problems in arc-dependent networks ⋮ Reachability in choice networks

This page was built for publication: On finding shortest paths in arc-dependent networks