Minimum Eccentricity Multicast Trees

We consider the problem of constructing a multicast tree that connects a group of source nodes to a group of sink nodes (receivers) and minimizes the maximum end-to-end delay between any pair of source/sink nodes. This is known as the \emphminimum eccentricity multicast tree problem, and is directly...

Full description

Bibliographic Details
Main Authors: David Krumme, Paraskevi Fragopoulou
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2001-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
Online Access:https://dmtcs.episciences.org/278/pdf