A note on Bertsekas' small-label-first strategy

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199703)29:2<111::AID-NET5>3.0.CO;2-M" /><111::AID-NET5>3.0.CO;2-M 10.1002/(SICI)1097-0037(199703)29:2<111::AID-NET5>3.0.CO;2-MzbMath0888.90138OpenAlexW1982630055MaRDI QIDQ4367278

Warren B. Powell, Zhi-Long Chen

Publication date: 25 November 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199703)29:2<111::aid-net5>3.0.co;2-m

zbMATH Keywords

shortest pathworst-case complexitylabeling algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

This page was built for publication: A note on Bertsekas' small-label-first strategy