A fixed-parameter-tractable algorithm for set packing

DOI10.1007/BF02669702zbMath0993.05043MaRDI QIDQ5957983

Chuanlin Zhang, Jian'er Chen, Wei-Jia Jia

Publication date: 13 March 2002

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

zbMATH Keywords

set packingfixed-parameter-tractable algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved fixed-parameter algorithm for vertex cover
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• On fixed-parameter tractability and approximability of NP optimization problems
• On the structure of parameterized problems in NP
• On the Amount of Nondeterminism and the Power of Verifying
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: A fixed-parameter-tractable algorithm for set packing