Kernels for Packing and Covering Problems
From MaRDI portal
Publication:2897995
DOI10.1007/978-3-642-29700-7_19zbMath1304.68070OpenAlexW2115683430MaRDI QIDQ2897995
No author found.
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://doi.org/10.1007/978-3-642-29700-7_19
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (11)
Edge-disjoint packing of stars and cycles ⋮ An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs ⋮ Almost Induced Matching: Linear Kernels and Parameterized Algorithms ⋮ A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion ⋮ On the vertex cover \(P_3\) problem parameterized by treewidth ⋮ A \(5k\)-vertex kernel for 3-path vertex cover ⋮ Parameterized algorithms and kernels for almost induced matching ⋮ Kernelization and Parameterized Algorithms for 3-Path Vertex Cover ⋮ Fixed-parameter algorithms for Vertex Cover \(P_3\) ⋮ Kernels for packing and covering problems ⋮ Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps
This page was built for publication: Kernels for Packing and Covering Problems
