On the parameterized complexity of compact set packing
From MaRDI portal
Publication:6091178
DOI10.1007/978-3-031-27051-2_30arXiv2111.06338OpenAlexW3213248339MaRDI QIDQ6091178
Publication date: 24 November 2023
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.06338
Cites Work
- On linear and semidefinite programming relaxations for hypergraph matching
- Structure preserving reductions among convex optimization problems
- Independent sets with domination constraints
- An approximation algorithm for maximum triangle packing
- On the complexity of approximating \(k\)-set packing
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
- Set Partitioning via Inclusion-Exclusion
- On the Lovász Theta Function for Independent Sets in Sparse Graphs
- On the hardness of learning sparse parities
- A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem
- On the parameterized complexity of approximating dominating set
- Parameterized Algorithms
- Approximation algorithms and hardness results for the clique packing problem
- Constant approximating k-clique is w[1-hard]
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the parameterized complexity of compact set packing
