Multi-source spanning trees: algorithms for minimizing source eccentricities

Authors:
H. Brendan McMahan;Andrzej Proskurowski
Affiliations:
Carnegie Mellon University, Pittsburgh, PA;University of Oregon, Eugene, OR
Venue:
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Year:
2004

Citing 4
Cited 5

Introduction to algorithms

Introduction to algorithms
Spanning Trees---Short or Small

SIAM Journal on Discrete Mathematics
Approximation algorithms for some optimum communication spanning tree problems

Discrete Applied Mathematics
The complexity of minimizing certain cost metrics for k-source spanning trees

Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"

The complexity of minimizing certain cost metrics for k-source spanning trees

Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
An improved algorithm for the k-source maximum eccentricity spanning trees

Discrete Applied Mathematics
The complexity of minimizing certain cost metrics for k-source spanning trees

Discrete Applied Mathematics
An efficient phase detector connection structure for the skew synchronization system

Proceedings of the 47th Design Automation Conference
Multi-source trees: algorithms for minimizing eccentricity cost metrics

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present two efficient algorithms constructing a spanning tree with minimum eccentricity of a source, for a given graph with weighted edges and a set of source vertices. The first algorithm is both simpler to implement and faster of the two. The second approach involves enumerating single-source shortest-path spanning trees for all points on a graph, a technique that may be useful in solving other problems.