Binary linear programming models for robust broadcasting in communication networks

DOI10.1016/j.dam.2015.11.008zbMath1333.05275OpenAlexW2220165760MaRDI QIDQ266832

Ronald G. McGarvey, Brian Q. Rieksts, José A. Ventura, Namsu Ahn

Publication date: 7 April 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.11.008

zbMATH Keywords

integer programmingcommunication networksbroadcastingfault-tolerant networks

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Related Items (1)

Broadcast graphs using new dimensional broadcast schemes for Knödel graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tight lower bounds on broadcast function for \(n = 24\) and 25
• Upper bounds on the broadcast function using minimum dominating sets
• On time-relaxed broadcasting networks
• Sparse broadcast graphs
• Broadcasting in DMA-bound bounded degree graphs
• Minimum broadcast graphs
• Compound constructions of broadcast networks
• Bounded-call broadcasting
• Minimum \(k\)-broadcast graphs
• Time-relaxed broadcasting in communication networks
• A 1-relaxed minimum broadcast graph on 15 vertices.
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• On the monotonicity of the broadcast function
• More broadcast graphs
• Efficient construction of broadcast graphs
• Improved upper and lower bounds fork-broadcasting
• An algorithm for constructing minimalc-broadcast networks
• k-Broadcasting in trees
• An Efficient Vertex Addition Method for Broadcast Networks
• Generalizations of broadcasting and gossiping
• Fault-tolerant broadcast graphs
• A survey of gossiping and broadcasting in communication networks
• Broadcast Networks of Bounded Degree
• On the construction of minimal broadcast networks
• Minimal broadcast networks
• Information Dissemination in Trees
• Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
• Tighter time bounds on fault-tolerant broadcasting and gossiping
• Time bounds on fault‐tolerant broadcasting
• Antepenultimate broadcasting
• Tight Bounds on Mimimum Broadcast Networks
• New Lower Bounds on Broadcast Function
• Fault-tolerant broadcasting and gossiping in communication networks

This page was built for publication: Binary linear programming models for robust broadcasting in communication networks