Gossiping in the Multicasting Communication Environment
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Analysis of Heuristics for the Freeze-Tag Problem
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
The Directed Minimum-Degree Spanning Tree Problem
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
On Multicriteria Online Problems
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Bicriteria Spanning Tree Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
An efficient heuristic for broadcasting in networks
Journal of Parallel and Distributed Computing
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Broadcasting in necklace graphs
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
Data Gathering Schedule for Minimal Aggregation Time in Wireless Sensor Networks
International Journal of Distributed Sensor Networks
Approximation algorithm for directed telephone multicast problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Theoretical Computer Science
On the bicriteria k-server problem
ACM Transactions on Algorithms (TALG)
Approximation schemes for multi-budgeted independence systems
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
The minimum degree spanning tree problem on directed acyclic graphs
ACS'06 Proceedings of the 6th WSEAS international conference on Applied computer science
Minimum multicast time problem in wireless sensor networks
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Matching based augmentations for approximating connectivity problems
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Optimal file distribution in peer-to-peer networks
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
The worst case behavior of randomized gossip
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
IEEE/ACM Transactions on Networking (TON)
Information Processing Letters
Linear algorithm for broadcasting in unicyclic graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Bounded-degree minimum-radius spanning trees in wireless sensor networks
Theoretical Computer Science
Randomized information dissemination in dynamic environments
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Given an undirected graph representing a network of processors, and a source node containing a message that must be broadcast to all the nodes, find a scheme that accomplishes the broadcast in the minimum number of time steps. At each time step, any processor that has received the message is allowed to communicate the message to at most one of its neighbors in the network, i.e. can communicate via a telephone call to a neighbor. This has been termed the minimum broadcast time problem under the telephone model and is known to be NP-complete. The minimum broadcast time in a graph is closely related to the poise of the graph. The poise of a tree is defined to be the quantity (maximum degree of any node in the tree+diameter of the tree). The poise of a graph is the minimum poise of any of its spanning trees. Computing the poise of a graph is shown to be NP-hard and an algorithm for computing a spanning tree of approximately minimum poise is derived. This algorithm is then used to derive an O(log/sup 2/n/log log n)-approximation for the minimum broadcast time problem on an n-node graph. Our algorithm extends to many generalizations of the problem such as the multicast problem, a telephone model allowing conference calls, and to the closely related minimum gossip time problem.