Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps
From MaRDI portal
Publication:2828236
DOI10.1145/2786015zbMath1347.68353OpenAlexW2257188417MaRDI QIDQ2828236
Jazmín Romero, Henning Fernau, Alejandro López-Ortiz
Publication date: 24 October 2016
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2786015
Nonnumerical algorithms (68W05) 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)
Related Items (2)
Cites Work
- Graph-based data clustering with overlaps
- An improved kernelization algorithm for \(r\)-set packing
- Looking at the stars
- A parameterized perspective on packing paths of length two
- Faster fixed-parameter tractable algorithms for matching and packing problems
- An improved kernelization for \(P_{2}\)-packing
- Another look at the degree constrained subgraph problem
- Packing triangles in bounded degree graphs.
- Kernels for Packing and Covering Problems
- Uniform Kernelization Complexity of Hitting Forbidden Minors
- A Problem Kernelization for Graph Packing
- The NP-Completeness of Some Edge-Partition Problems
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- A Parameterized Algorithm for Packing Overlapping Subgraphs
- Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels
- On the completeness of a generalized matching problem
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps
