An O *(3.523k ) Parameterized Algorithm for 3-Set Packing

DOI10.1007/978-3-540-79228-4_7zbMath1139.68345OpenAlexW191748763MaRDI QIDQ3502635

Qilong Feng, Jianxin Wang

Publication date: 27 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79228-4_7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (12)

Mixing Color Coding-Related Techniques ⋮ Parameterized approximation algorithms for packing problems ⋮ Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets ⋮ Narrow sieves for parameterized paths and packings ⋮ Matching and weighted \(P_2\)-packing: algorithms and kernels ⋮ Improved Parameterized Algorithms for Weighted 3-Set Packing ⋮ Packing paths: recycling saves time ⋮ Parameterized algorithms for weighted matching and packing problems ⋮ Improved deterministic algorithms for weighted matching and packing problems ⋮ A Problem Kernelization for Graph Packing ⋮ The \(k\)-distinct language: parameterized automata constructions ⋮ A Parameterized Perspective on Packing Paths of Length Two

This page was built for publication: An O *(3.523k ) Parameterized Algorithm for 3-Set Packing