Minimum Eccentricity Multicast Trees
Discrete mathematics & theoretical computer science, Tome 4 (2000-2001) no. 2.

Voir la notice de l'article provenant de la source Episciences

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 related to the quality of service requirements of real multipoint applications. We deal directly with the problem in its general form, meaning that the sets of source and sink nodes need not be overlapping nor disjoint. The main contribution of this work is a polynomial algorithm for this problem on general networks which is inspired by an innovative method that uses geometric relationships on the xy-plane.
@article{DMTCS_2001_4_2_a6,
     author = {Krumme, David and Fragopoulou, Paraskevi},
     title = {Minimum {Eccentricity} {Multicast} {Trees}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {4},
     number = {2},
     year = {2000-2001},
     doi = {10.46298/dmtcs.278},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.278/}
}
TY  - JOUR
AU  - Krumme, David
AU  - Fragopoulou, Paraskevi
TI  - Minimum Eccentricity Multicast Trees
JO  - Discrete mathematics & theoretical computer science
PY  - 2000-2001
VL  - 4
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.278/
DO  - 10.46298/dmtcs.278
LA  - en
ID  - DMTCS_2001_4_2_a6
ER  - 
%0 Journal Article
%A Krumme, David
%A Fragopoulou, Paraskevi
%T Minimum Eccentricity Multicast Trees
%J Discrete mathematics & theoretical computer science
%D 2000-2001
%V 4
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.278/
%R 10.46298/dmtcs.278
%G en
%F DMTCS_2001_4_2_a6
Krumme, David; Fragopoulou, Paraskevi. Minimum Eccentricity Multicast Trees. Discrete mathematics & theoretical computer science, Tome 4 (2000-2001) no. 2. doi : 10.46298/dmtcs.278. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.278/

Cité par Sources :