Packing and covering a tree by subtrees

DOI10.1007/BF02579383zbMath0642.05042MaRDI QIDQ1101129

B. George

Publication date: 1986

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

algorithms; polyhedra; greedy algorithm; intersection graph; 0-1 programming; covering a tree by subtrees; packing subtrees into a tree; tree-matrix

Mathematics Subject Classification ID

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

Finding minimum cost directed trees with demands and capacities