Packing and covering a tree by subtrees


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”.

This is a preview of subscription content, access via your institution.


  1. [1]

    I. Bárány, T. J. Van Roy, andL. A. Wolsey, Uncapacitated Lot-Sizing: The Convex Hull-of Solutions,Mathematical Programming Study,22 (1984), 32–43.

    MATH  Google Scholar 

  2. [2]

    A. Frank, Some Polynomial Algorithms for Certain Graphs and Hypergraphs,Proceedings of the 5th British Combinatorial Conference, Congressus Numerantium XV,Utilitas Math., Winnipeg (1976).

  3. [3]

    F. Gavril, The intersection Graphs of Subtrees in Trees are Exactly the Chordal Graphs,Journal of Combinatorial Theory, B 16, (1974), 47–56.

    MATH  Article  MathSciNet  Google Scholar 

  4. [4]

    M. C. Golumbic,Algorithmic Graph Theory and Perfect Graphs, Academic Press, (1980).

  5. [5]

    H. Gröflin andT. M. Liebling, Connected and Alternating Vectors: Polyhedra and Algorithms,Mathematical Programming,20 (1981), 233–244.

    MATH  Article  MathSciNet  Google Scholar 

  6. [6]

    A. J. Hoffman, A. W. J. Kolen andM. Sakarovitch, Totally Balanced and Greedy Matrices,Prepring BW 165/82,Stiching Mathematisch Centrum, Amsterdam, (1982).

  7. [7]

    A. W. J. Kolen, Solving Covering Problems and the Uncapacitated Plant Location Problem on Trees,Preprint BW 163/82,Stichting Mathematisch Centrum, Amsterdam (1982).

Download references

Author information



Rights and permissions

Reprints and Permissions

About this article

Cite this article

Bárány, I., Wolsey, L.A. & Edmonds, J. Packing and covering a tree by subtrees. Combinatorica 6, 221–233 (1986).

Download citation

AMS subject classification (1980)

  • 68 E 10
  • 05 C 05
  • 05 B 40