Packing and covering a tree by subtrees
From MaRDI portal
Publication:1101129
DOI10.1007/BF02579383zbMath0642.05042MaRDI QIDQ1101129
Publication date: 1986
Published in: Combinatorica (Search for Journal in Brave)
algorithms; polyhedra; greedy algorithm; intersection graph; 0-1 programming; covering a tree by subtrees; packing subtrees into a tree; tree-matrix
05C05: Trees
90C10: Integer programming
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05B40: Combinatorial aspects of packing and covering
Related Items
Capacitated location-allocation problems on a line, Finding minimum cost directed trees with demands and capacities, Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems, Modelling piecewise linear concave costs in a tree partitioning problem, A dynamic programming algorithm for the local access telecommunication network expansion problem, Optimizing constrained subtrees of trees, Lot-sizing with fixed charges on stocks: the convex hull