Partial Degree Bounded Edge Packing Problem
From MaRDI portal
Publication:2898010
DOI10.1007/978-3-642-29700-7_33zbMath1304.05113arXiv1201.3184OpenAlexW2140747265MaRDI QIDQ2898010
Publication date: 16 July 2012
Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.3184
Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (3)
Constant factor approximation for the weighted partial degree bounded edge packing problem ⋮ Partial degree bounded edge packing problem for graphs and \(k\)-uniform hypergraphs ⋮ Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem
This page was built for publication: Partial Degree Bounded Edge Packing Problem
