Minimum eccentricity multicast trees

MaRDI QIDQ2752462zbMATH OpenFDO

Authors David Krumme, P. Fragopoulou

Publication date 7 January 2002

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/121680, http://www.emis.de/journals/DMTCS/volumes/abstracts/dm040208.abs.html

zbMATH Keywords

algorithmcommunicationsgraphnetwork

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Multi-source spanning trees: Algorithms for minimizing source eccentricities.
• Algorithms and Computation
• scientific article; zbMATH DE number 1990677
• An efficient algorithm for constructing delay bounded minimum cost multicast trees
• SOFSEM 2005: Theory and Practice of Computer Science

Cited in

(5)

• The complexity of minimizing certain cost metrics for k-source spanning trees.
• Multi-source spanning trees: Algorithms for minimizing source eccentricities.
• An improved algorithm for the k-source maximum eccentricity spanning trees
• Minimax flow tree problems
• A new bound of radius with irregularity index

This page was built for publication: Minimum eccentricity multicast trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2752462)