A Quadratic Kernel for 3-Set Packing
From MaRDI portal
Publication:3630192
DOI10.1007/978-3-642-02017-9_11zbMath1241.68127OpenAlexW1857068822MaRDI QIDQ3630192
Publication date: 3 June 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02017-9_11
Nonnumerical algorithms (68W05) Combinatorial optimization (90C27) Combinatorial aspects of packing and covering (05B40)
Related Items (4)
An improved kernel for planar vertex-disjoint triangle packing ⋮ Confronting intractability via parameters ⋮ A kernelization algorithm for \(d\)-hitting set ⋮ Triangle packing in (sparse) tournaments: approximation and kernelization
This page was built for publication: A Quadratic Kernel for 3-Set Packing