Improved deterministic algorithms for weighted matching and packing problems

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

Volumn 5532 LNCS, Issue , 2009, Pages 211-220

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

^a CENTRAL SOUTH UNIVERSITY   (China)

^b Texas A and M University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC ALGORITHMS; MATCHING PROBLEMS; PACKING PROBLEMS; PARAMETERIZED ALGORITHM; RUNNING TIME; SET PACKING PROBLEM; TIME COMPLEXITY; UPPER BOUND; WEIGHTED MATCHING;

ALGORITHMS; THREE DIMENSIONAL;

SET THEORY;

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

References (15)

1. Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999).
2. Liu, Y., Chen, J., Wang, J.: On efficient FPT algorithms for weighted matching and packing problems. In: Proc. 4th Ann. Conference on Theory and Applications of Models of Computation (TAMC 2007). LNCS, vol. 4484, pp. 575-586 (2007).
3. Wang, J., Feng, Q.: Improved parameterized algorithms for weighted 3-set packing. In: Hu, X.,Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 130-139. Springer, Heidelberg (2008).
4. Chen, J., Kneis, J., Lu, S., Mölle, D., Richter, S., Rossmanith, P., Sze, S., Zhang, F.: Randomized divide-and-conquer: improved path, matching, and packing algorithms. SIAM Journal on Computing (to appear).
5. Fellows, M., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D., Whitesides, S.: Faster fixed-parameter tractable algorithms for matching and packing problems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 311-322. Springer, Heidelberg (2004).
6. Chen, J., Friesen, D., Jia, W., Kanj, I.: Using nondeterminism to design efficient deterministic algorithms. Algorithmica 40, 83-97 (2004).
7. Jia, W., Zhang, C., Chen, J.: An efficient parameterized algorithm for m-set packing. Journal of Algorithms 50, 106-117 (2004).
8. Koutis, I.: A faster parameterized algorithm for set packing. Information Processing Letters 94, 7-9 (2005).
9. Liu, Y., Lu, S., Chen, J., Sze, S.H.: Greedy localization and color-coding: improved matching and packing algorithms. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 84-95. Springer, Heidelberg (2006).
10. 3k) parameterized algorithm for 3-set packing. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 82-93. Springer, Heidelberg (2008).
11. Koutis, I.: Faster algebraic algorithms for path and packing problems. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 575-586. Springer, Heidelberg (2008).
12. k) time, arXiv:0807.3026v2 [cs.DS] (2008).
13. Naor, M., Schulman, L., Srinivasan, A.: Splitters and near-optimal derandomization. In: Proc. 39th Annual Symposium on Foundatins of Computer Science (FOCS 1995), pp. 182-190 (1995).
14. Fredman, M., Komlos, J., Szemeredi, E.: Storing a sparse table with O(1) worst case access time. Journal of the ACM 31, 538-544 (1984).
15. Shoup, V.: A Computational Introduction to Number Theory and Algebra, 2nd edn. Cambridge Univesity Press, New York (2008).