Improved deterministic algorithms for weighted matching and packing problems

Theoretical Computer Science

Volumn 412, Issue 23, 2011, Pages 2503-2512

  Chen, Jianer ^a,b   Feng, Qilong ^a   Liu, Yang ^c   Lu, Songjian ^b   Wang, Jianxin ^a  

^a CENTRAL SOUTH UNIVERSITY   (China)

^b Texas AandM University   (United States)

^c UNIVERSITY OF TEXAS PAN AMERICAN   (United States)

Author keywords

(n,k) universal set; r SET PACKING; Randomized divide and conquer; rD MATCHING

Indexed keywords

(N,K)-UNIVERSAL SET; DETERMINISTIC ALGORITHMS; DIVIDE AND CONQUER; KERNELIZATION; MATCHING PROBLEMS; PACKING PROBLEMS; PARAMETERIZED ALGORITHM; RD-MATCHING; RUNNING TIME; SET PACKING; SET PACKING PROBLEM; TIME COMPLEXITY; UPPER BOUND; WEIGHTED MATCHING;

ALGORITHMS;

EID: 79954622935     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.10.042     Document Type: Article

References (17)

1. J. Chen, D. Friesen, W. Jia, and I. Kanj Using nondeterminism to design effcient deterministic algorithms Algorithmica 40 2004 83 97 (Pubitemid 40871650)
2. J. Chen, J. Kneis, S. Lu, D. Mlle, S. Richter, P. Rossmanith, S. Sze, and F. Zhang Randomized divide-and-conquer: improved path, matching, and packing algorithms SIAM Journal of Computing 38 2009 2526 2547
3. H. Dell, D. van Melkebeek, Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses, in: Proc. 42nd ACM Symp. Theory of Computing, STOC 2010, 2010, pp. 251260.
4. R. Downey, and M. Fellows Parameterized Complexity 1999 Springer New York
5. M. Fellows, C. Knauer, N. Nishimura, P. Ragde, F. Rosamond, U. Stege, D. Thilikos, and S. Whitesides Faster fixed-parameter tractable algorithms for matching and packing problems Algorithmica 52 2008 167 176
6. M. Fredman, J. Komlos, and E. Szemeredi Storing a sparse table with O (1 ) worst case access time Journal of the ACM 31 1984 538 544 (Pubitemid 15563701)
7. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman San Francisco
8. W. Jia, C. Zhang, and J. Chen An effcient parameterized algorithm for m-set packing Journal of Algorithms 50 2004 106 117
9. I. Koutis A faster parameterized algorithm for set packing Information Processing Letters 94 2005 7 9 (Pubitemid 40259607)
10. I. Koutis Faster algebraic algorithms for path and packing problems Proc. 35th International Colloquium on Automata, Languages and Programming, ICALP 2008 Lecture Notes in Computer Science 5125 2008 575 586
11. Y. Liu, J. Chen, and J. Wang On effcient FPT algorithms for weighted matching and packing problems Proc. 4th Ann. Conference on Theory and Applications of Models of Computation, TAMC 2007 Lecture Notes in Computer Science vol. 4484 2007 575 586
12. Y. Liu, S. Lu, J. Chen, and S.H Sze Greedy localization and color-coding: improved matching and packing algorithms Proc. 2nd International Workshop on Parameterized and Exact Computation, IWPEC 2006 Lecture Notes in Computer Science vol. 4169 2006 84 95 (Pubitemid 44609914)
13. M. Naor, L. Schulman, A. Srinivasan, Splitters and near-optimal derandomization, in: Proc. 39th Annual Symposium on Foundatins of Computer Science, FOCS 1995, 1995, pp. 182190.
14. V. Shoup A Computational Introduction to Number Theory and Algebra 2nd ed. 2008 Cambridge Univesity Press New York
15. J. Wang, and Q. Feng Improved parameterized algorithms for weighted 3-set packing Proc. 14th Annual International Computing and Combinatorics Conference, COCOON 2008 Lecture Notes in Computer Science vol. 5092 2008 130 139
16. 3k ) parameterized algorithm for 3-set packing Proc. 5th Annual Conference on Theory and Applications of Models of Computation, TAMC 2008 Lecture Notes in Computer Science vol. 4978 2008 82 93
17. k ) time Information Processing Letters 109 2009 315 318