A fast algorithm for computing minimum routing cost spanning trees

DOI10.1016/j.comnet.2008.08.013zbMath1152.68325OpenAlexW2123757175MaRDI QIDQ2377885

Rui Campos, Manuel Ricardo

Publication date: 20 January 2009

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2008.08.013

zbMATH Keywords

shortest path treeminimum spanning treeroutingbridgingminimum routing cost tree

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (3)

Models and algorithms for network reduction ⋮ Special issue on: Optimization methods for decision making: advances and applications ⋮ The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm

This page was built for publication: A fast algorithm for computing minimum routing cost spanning trees