An algorithm of the minimal cost spanning tree about communication network

MaRDI QIDQ3537381zbMATH OpenFDO

Authors Jianye An, Yiliang Yu, Jian Hua Zhu

Publication date 24 November 2008

zbMATH Keywords

``Checkerboard distancecommunication networkimaginary stationminimal cost spanning treemost short-path spanning tree

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Communication networks in operations research (90B18)

Recommendations

• Algorithms for the optimum communication spanning tree problem
• scientific article; zbMATH DE number 3891405
• Constrained Optimum Communication Trees and Sensitivity Analysis
• Approximation algorithms for some optimum communication spanning tree problems
• Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs

Cited in

(3)

• The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm
• A solvable routing problem
• scientific article; zbMATH DE number 2014426 (Why is no real title available?)

This page was built for publication: An algorithm of the minimal cost spanning tree about communication network

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