User menu

Packing and Covering a Tree By Subtrees

Bibliographic reference Barany, I. ; Edmonds, J. ; Wolsey, Laurence. Packing and Covering a Tree By Subtrees. In: Combinatorica, Vol. 6, no. 3, p. 221-233 (1986)
Permanent URL http://hdl.handle.net/2078.1/53976
  1. Barany Imre, Roy Tony, Wolsey Laurence A., Uncapacitated lot-sizing: The convex hull of solutions, Mathematical Programming Studies (1984) ISBN:9783642009143 p.32-43, 10.1007/bfb0121006
  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. F. Gavril, The intersection Graphs of Subtrees in Trees are Exactly the Chordal Graphs,Journal of Combinatorial Theory, B 16, (1974), 47–56.
  4. M. C. Golumbic,Algorithmic Graph Theory and Perfect Graphs, Academic Press, (1980).
  5. H. Gröflin andT. M. Liebling, Connected and Alternating Vectors: Polyhedra and Algorithms,Mathematical Programming,20 (1981), 233–244.
  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. A. W. J. Kolen, Solving Covering Problems and the Uncapacitated Plant Location Problem on Trees,Preprint BW 163/82,Stichting Mathematisch Centrum, Amsterdam (1982).