Technical Reports
Display by Author: A
| B
| C
| D
| E
| F
| G
| H
| I
| J
| K
| L
| M
| N
| O
| P
| Q
| R
| S
| T
| U
| V
| W
| X
| Y
| Z
TR-1999-2
A Program that Finds a Minimum Eccentricity Multicast Tree |
|
Authors: | Krumme, David W. |
Date: | 1999 |
Pages: | 11 |
Download Formats: | [PDF] |
This report is a companion to the paper Minimum Eccentricity Multicast Trees. The paper describes an algorithm for finding in an undirected, weighted graph a spanning tree which minimizes the worst-case distance from a source to a sink. The sources and sinks are arbitrary, fixed subsets of the vertices. This report presents a program implementing that algorithm. This problem arises as a potential solution to the problem of choosing pathways along which to effect a multicast from a set of source nodes to a set of sinks in a communication network. |
Faculty: for help posting a technical report please visit the User Guide.