Transmissions in a network with capacities and delays

DOI<167::AID-NET2>3.0.CO;2-J 10.1002/(SICI)1097-0037(199905)33:3<167::AID-NET2>3.0.CO;2-JzbMath0948.90029OpenAlexW2021468914MaRDI QIDQ4254351

Dimitrios Kagaris, Spyros Tragoudas, Christos D. Zaroliagis, Grammati E. Pantziou

Publication date: 29 June 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199905)33:3<167::aid-net2>3.0.co;2-j

zbMATH Keywords

data transmissionquickest pathtransmission timedynamic algorithmsparse network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (3)

A label-setting algorithm for finding a quickest path ⋮ A comprehensive survey on the quickest path problem ⋮ The quickest path problem with interval lead times

Cites Work

• Unnamed Item
• Unnamed Item
• On-line and dynamic algorithms for shortest path problems

This page was built for publication: Transmissions in a network with capacities and delays