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

Authors:
Harold S. Connamacher;Andrzej Proskurowski
Affiliations:
Department of Computer and Information Science, University of Oregon, Eugene, OR;Department of Computer and Information Science, University of Oregon, Eugene, OR
Venue:
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Year:
2003

Citing 4
Cited 3

Spanning Trees---Short or Small

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

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Multi-source spanning trees: algorithms for minimizing source eccentricities

Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)

Multi-source spanning trees: algorithms for minimizing source eccentricities

Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
An improved algorithm for the k-source maximum eccentricity spanning trees

Discrete Applied Mathematics
On the intercluster distance of a tree metric

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate multisource spanning tree problems where, given a graph with edge weights and a subset of the nodes defined as sources, the object is to find a spanning tree of the graph that minimizes some distance-related cost metric. This problem can be used to model multicasting in a network where messages are sent from a fixed collection of senders and communication takes place along the edges of a single spanning tree. For a limited set of possible cost metrics of such a spanning tree, we either prove the problem is NP-hard or we demonstrate the existence of an efficient algorithm to find an optimal tree.