Strong bounds and exact solutions to the minimum broadcast time problem
From MaRDI portal
Publication:6609717
Cites work
- 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?)
- A 2/3-approximation algorithm for vertex weighted matching in bipartite graphs
- A Neighborhood Search Technique for the Freeze Tag Problem
- A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm
- 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-Time Broadcast
- Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks
- Binary linear programming models for robust broadcasting in communication networks
- Broadcasting in DMA-bound bounded degree graphs
- Fast gossiping by short messages
- 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
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)
