Packing and covering a tree by subtrees
From MaRDI portal
Publication:1101129
DOI10.1007/BF02579383zbMath0642.05042OpenAlexW1977577374MaRDI QIDQ1101129
Publication date: 1986
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579383
algorithmspolyhedragreedy algorithmintersection graph0-1 programmingcovering a tree by subtreespacking subtrees into a treetree-matrix
Trees (05C05) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)
Related Items
Modelling piecewise linear concave costs in a tree partitioning problem, Packing and covering with balls on Busemann surfaces, Lot-sizing with fixed charges on stocks: the convex hull, Lot-size models with backlogging: Strong reformulations and cutting planes, Optimizing constrained subtrees of trees, Recognizing single-peaked preferences on a tree, Polyhedral properties of the \(K\)-median problem on a tree, Relaxations for two-level multi-item lot-sizing problems, Approximation algorithms for \(k\)-hurdle problems, LS-LIB: A Library of Tools for Solving Production Planning Problems, Finding minimum cost directed trees with demands and capacities, On a labeling problem in graphs, Capacitated location-allocation problems on a line, The game of cops and eternal robbers, Approximation Algorithms for k-Hurdle Problems, Gain-sharing in urban consolidation centers, A dynamic programming algorithm for the local access telecommunication network expansion problem, Models for planning capacity expansion in local access telecommunication networks, Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
Cites Work
