Computing the shortest network under a fixed topology

DOI10.1109/TC.2002.1032631MaRDI QIDQ4571275zbMATH OpenFDO

Authors Guoliang Xue, Krishnaiyan Thulasiraman

Publication date 9 July 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Cited in

(7)

• Steiner trees for fixed orientation metrics
• Network-Tree Model and Shortest Path Algorithm
• Computingk-shortest path lengths in euclidean networks
• scientific article; zbMATH DE number 1382484 (Why is no real title available?)
• scientific article; zbMATH DE number 1182573 (Why is no real title available?)
• A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS
• Shortest-path queries in static networks

This page was built for publication: Computing the shortest network under a fixed topology

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