✦ LIBER ✦

Bottleneck multicast trees in linear time

✍ Scribed by Georgiadis, L.

Book ID: 117885460
Publisher: IEEE
Year: 2003
Tongue: English
Weight: 308 KB
Volume: 7
Category: Article
ISSN: 1089-7798
DOI: 10.1109/lcomm.2003.820102

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving linear bottleneck assignment pro

Solving linear bottleneck assignment problems via strong spanning trees

✍ Ronald D Armstrong; Zhiying Jin 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 136 KB

Real-time multicast tree visualization a

Real-time multicast tree visualization and monitoring

✍ David B. Makofske; Kevin C. Almeroth 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 544 KB

Bottleneck Steiner trees in the plane

✍ Sarrafzadeh, M.; Wong, C.K. 📂 Article 📅 1992 🏛 IEEE 🌐 English ⚖ 532 KB

Scheduling time-constrained multicast me

Scheduling time-constrained multicast messages in circuit-switched tree networks

✍ Oh-Heum Kwon 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 146 KB

In this paper, we consider a kind of multicast scheduling problem in a tree network. Each multicast message is transmitted through a directed subtree within the tree network. The transmission time of each multicast message is assumed to be one unit. Two messages can be transmitted at the same time i

Linear time tree codes

✍ G. Tinhofer; H. Schreck 📂 Article 📅 1984 🏛 Springer Vienna 🌐 English ⚖ 776 KB

Efficient Group Coordination in Multicas

Efficient Group Coordination in Multicast Trees

✍ H.-P. Dommel; J. J. Garcia-Luna-Aceves 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 82 KB