An algorithm for constructing minimalc-broadcast networks

DOI10.1002/net.1019zbMath0984.68007OpenAlexW1809183192MaRDI QIDQ2747800

José A. Ventura, Shiwoo Lee

Publication date: 5 May 2002

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.1019

zbMATH Keywords

\(c\)-broadcastingnetwork compounding algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10)

Related Items (3)

Binary linear programming models for robust broadcasting in communication networks ⋮ A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm ⋮ A linear algorithm for finding the k‐broadcast center of a tree

Cites Work

• Unnamed Item
• Broadcasting in DMA-bound bounded degree graphs
• Minimum broadcast graphs
• Compound constructions of broadcast networks
• Bounded-call broadcasting
• Minimum \(k\)-broadcast graphs
• Generalizations of broadcasting and gossiping
• A survey of gossiping and broadcasting in communication networks
• Information Dissemination in Trees
• Antepenultimate broadcasting
• Tight Bounds on Mimimum Broadcast Networks

This page was built for publication: An algorithm for constructing minimalc-broadcast networks