DYNAMIC MODELS OF SHORTEST PATH ROUTING ALGORITHMS FOR COMMUNICATION NETWORKS WITH MULTIPLE DESTINATIONS.

Dimitri P. Bertsekas

Research output: Contribution to journal › Conference article › peer-review

11 Scopus citations

Fingerprint

Dive into the research topics of 'DYNAMIC MODELS OF SHORTEST PATH ROUTING ALGORITHMS FOR COMMUNICATION NETWORKS WITH MULTIPLE DESTINATIONS.'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science