An O *(3.523k ) Parameterized Algorithm for 3-Set Packing
From MaRDI portal
Publication:3502635
DOI10.1007/978-3-540-79228-4_7zbMath1139.68345MaRDI QIDQ3502635
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
68Q25: Analysis of algorithms and problem complexity
68W05: Nonnumerical algorithms
90C27: Combinatorial optimization
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)