Abstract.We consider the following problem: Given a complete graph G=(V,E) with a cost on every edge and a given collection of subsets of V, we have to find a minimum cost spanning tree T such that each subset of the vertices in the collection induces a subtree in T. One motivation for this problem is to construct a minimum cost communication tree network for a collection of non-disjoint groups of customers such that the network will provide ``group fault tolerance'' and ``group privacy''. We model this problem as a matroid. We extend it to general matroids and call the new matroids ``clustering matroids''. We define three variations of the clustering tree problem and show that from an algorithmic point of view they are polynomially equivalent. We present a polynomial algorithm for one of the three variations, which implies that all of them can be solved polynomially. For the case where the cardinality of the subsets in the collection does not exceed three, we provide a greedy algorithm, a linear algorithm and also a polyhedron description of the convex hull of all the feasible solutions.
[1]
R. Rado.
Note on Independence Functions
,
1957
.
[2]
Jack Edmonds,et al.
Matroids and the greedy algorithm
,
1971,
Math. Program..
[3]
Fanica Gavril,et al.
A recognition algorithm for the intersection graphs of paths in trees
,
1978,
Discret. Math..
[4]
David S. Johnson,et al.
Computers and Intractability: A Guide to the Theory of NP-Completeness
,
1978
.
[5]
M. Golumbic.
Algorithmic graph theory and perfect graphs
,
1980
.
[6]
R. Bixby.
Recent Algorithms for Two Versions of Graph Realization and Remarks on Applications to Linear Programming
,
1984
.
[7]
Martin Charles Golumbic,et al.
Edge and vertex intersection of paths in a tree
,
1985,
Discret. Math..
[8]
F. McMorris,et al.
Topics in Intersection Graph Theory
,
1987
.
[9]
Donald K. Wagner,et al.
On the Consecutive-Retrieval Problem
,
1994,
SIAM J. Comput..
[10]
William J. Cook,et al.
Combinatorial optimization
,
1997
.