Strong bounds and exact solutions to the minimum broadcast time problem

DOI10.1111/ITOR.13304MaRDI QIDQ6609717zbMATH OpenFDO

Authors Marika Ivanova, Dag Haugland, Bård Hennning Tvedt

Publication date 24 September 2024

Published in International Transactions in Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1111/ITOR.13304

zbMATH Keywords

boundsbroadcastingcomputational experimentsinteger programming

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A 2/3-approximation algorithm for vertex weighted matching in bipartite graphs
• A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm
• A Neighborhood Search Technique for the Freeze Tag Problem
• A survey of gossiping and broadcasting in communication networks
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• An efficient heuristic for broadcasting in networks
• Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks
• Approximation Algorithms for Minimum-Time Broadcast
• Binary linear programming models for robust broadcasting in communication networks
• Broadcasting in DMA-bound bounded degree graphs
• Fast gossiping by short messages
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2079323 (Why is no real title available?)
• scientific article; zbMATH DE number 857072 (Why is no real title available?)
• Hypercubes, shuffle-exchange graphs and de Bruijn digraphs
• Information Dissemination in Trees
• Message Multicasting in Heterogeneous Networks
• Methods and problems of communication in usual networks
• Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
• Optimal sequential gossiping by short messages
• Primes in Fibonacci n-step and Lucas n-step sequences
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• The minimum broadcast time problem for several processor networks
• Tight Bounds on Mimimum Broadcast Networks

Cited in

(2)

• Biased random-key genetic algorithms for the weighted minimum broadcast time problem
• Broadcasting two messages in wheel graphs

This page was built for publication: Strong bounds and exact solutions to the minimum broadcast time problem

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