Strong bounds and exact solutions to the minimum broadcast time problem
From MaRDI portal
Publication:6609717
DOI10.1111/ITOR.13304MaRDI QIDQ6609717FDOQ6609717
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)
Cites Work
- Title not available (Why is that?)
- Broadcasting in DMA-bound bounded degree graphs
- Binary linear programming models for robust broadcasting in communication networks
- A survey of gossiping and broadcasting in communication networks
- Information Dissemination in Trees
- Tight Bounds on Mimimum Broadcast Networks
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Methods and problems of communication in usual networks
- Title not available (Why is that?)
- 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
- A Neighborhood Search Technique for the Freeze Tag Problem
- Title not available (Why is that?)
- An efficient heuristic for broadcasting in networks
- Approximation Algorithms for Minimum-Time Broadcast
- Message Multicasting in Heterogeneous Networks
- Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
- Optimal sequential gossiping by short messages
- Fast gossiping by short messages
- Hypercubes, shuffle-exchange graphs and de Bruijn digraphs
- A 2/3-approximation algorithm for vertex weighted matching in bipartite graphs
- Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks
- A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm
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)
