For two polyhedra associated with packing subtrees of a tree, the structure of the vertices is described, and efficient algorithms are given for optimisation over the polyhedra. For the related problem of covering a tree by subtrees, a reduction to a packing problem, and an efficient algorithm are presented when the family of trees is “fork-free”.
AMS subject classification (1980)68 E 10 05 C 05 05 B 40
Unable to display preview. Download preview PDF.
- A. Frank, Some Polynomial Algorithms for Certain Graphs and Hypergraphs,Proceedings of the 5th British Combinatorial Conference, Congressus Numerantium XV,Utilitas Math., Winnipeg (1976).Google Scholar
- M. C. Golumbic,Algorithmic Graph Theory and Perfect Graphs, Academic Press, (1980).Google Scholar
- A. J. Hoffman, A. W. J. Kolen andM. Sakarovitch, Totally Balanced and Greedy Matrices,Prepring BW 165/82,Stiching Mathematisch Centrum, Amsterdam, (1982).Google Scholar
- A. W. J. Kolen, Solving Covering Problems and the Uncapacitated Plant Location Problem on Trees,Preprint BW 163/82,Stichting Mathematisch Centrum, Amsterdam (1982).Google Scholar