Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode
Author:
- 17 August 2001
- book chapter
- Published by Springer Nature
- p. 440-451
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Broadcasting and multicasting in cut-through routed networks2002
- A threshold of ln n for approximating set coverJournal of the ACM, 1998
- Broadcasting, multicasting and gossiping in trees under the all-port line model1998
- Multicasting in heterogeneous networks1998
- Multipoint communication: a survey of protocols, functions, and mechanismsIEEE Journal on Selected Areas in Communications, 1997
- Toward a general theory of unicast-based multicast communicationLecture Notes in Computer Science, 1995
- Fast gossiping by short messages1995
- Approximating the Minimum-Degree Steiner Tree to within One of OptimalJournal of Algorithms, 1994
- Methods and problems of communication in usual networksDiscrete Applied Mathematics, 1994
- Minimum‐time line broadcast networksNetworks, 1980