Single path routing with delay considerations

DOI10.1016/0169-7552(92)90087-7zbMath0762.90023OpenAlexW2057863515MaRDI QIDQ4017614

Rahul Simha, Bhagirath Narahari

Publication date: 16 January 1993

Published in: Computer Networks and ISDN Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0169-7552(92)90087-7

zbMATH Keywords

heuristicbroadcastingoptimal routingring network\({\mathcal NP}\)-completehigh traffic networksminiumum spanning treemultiple source-destination pairs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Transportation, logistics and supply chain management (90B06)

Related Items (1)

The minimum labeling spanning trees

This page was built for publication: Single path routing with delay considerations