On the parameterized complexity of compact set packing

DOI10.1007/s00453-024-01269-6MaRDI QIDQ6623598

Ameet Gadekar

Publication date: 24 October 2024

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

set packingparameterized complexity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On linear and semidefinite programming relaxations for hypergraph matching
• Structure preserving reductions among convex optimization problems
• Independent sets with domination constraints
• Parametrized complexity theory.
• 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]

This page was built for publication: On the parameterized complexity of compact set packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6623598)