Time complexity of a path formulated optimal routing algorithm (second printing)

DOI10.1109/9.317108MaRDI QIDQ4324919zbMATH OpenOpenAlexFDO

Authors John K. Antonio, Wei K. Tsai, Garng M. Huang

Publication date 21 March 1995

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/9.317108

zbMATH Keywords

complexityconvergence rateoptimal routing algorithmpath

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 4051669
• Optimal routing in a transportation network
• A linear time algorithm for optimal routing around a rectangle
• An Appraisal of Some Shortest-Path Algorithms
• Time complexity of a path formulated optimal routing algorithm

Cited in

(1)

• Time complexity of a path formulated optimal routing algorithm

This page was built for publication: Time complexity of a path formulated optimal routing algorithm (second printing)

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