A quadratic kernel for 3-set packing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5532 LNCS, Issue , 2009, Pages 81-87

  Abu Khzam, Faisal N ^a  

^a LEBANESE AMERICAN UNIVERSITY   (Lebanon)

Author keywords

Crown decomposition; Fixed parameter algorithms; Kernelization; Set packing

Indexed keywords

CROWN DECOMPOSITION; FIXED-PARAMETER ALGORITHMS; INPUT PARAMETER; KERNELIZATION; PARAMETERIZED; PROBLEM KERNEL; QUADRATIC FUNCTION; QUADRATIC KERNELS; SET PACKING; SET PACKING PROBLEM;

SET THEORY;

EID: 67650214934     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02017-9_11     Document Type: Conference Paper

References (8)

1. Abu-Khzam, F.N., Fellows, M.R., Langston, M.A., Suters, W.H.: Crown Structures for Vertex Cover Kernelization. Theory of Computing Systems (TOCS) 41(3), 411- 430 (2007)
2. 2) Steps. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 257-269. Springer, Heidelberg (2004)
3. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)
4. Fellows, M.R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D.M.,Whitesides, S.: Faster fixed-parameter tractable algorithms for matching and packing problems. Algorithmica 52(2), 167-176 (2008)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
6. Jia, W., Zhang, C., Chen, J.: An efficient parameterized algorithm for m-set packing. J. Algorithms 50, 106-117 (2004)
7. Koutis, I.: A faster parameterized algorithm for set packing. Information Processing Letters 94, 7-9 (2005)
8. Liu, Y., Chen, J., Wang, J.: Parameterized Algorithms for Weighted Matching and Packing Problems. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol. 4484, pp. 692-702. Springer, Heidelberg (2007)