Improved parameterized algorithms for weighted 3-set packing

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

Volumn 5092 LNCS, Issue , 2008, Pages 130-139

  Wang, Jianxin ^a   Feng, Qilong ^a  

^a CENTRAL SOUTH UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORICS; INTERNATIONAL CONFERENCES; NP-HARD PROBLEMS; PACKING PROBLEMS; PARAMETERIZED ALGORITHMS; SET PACKING; SET PACKING PROBLEM;

NUCLEAR PROPULSION;

EID: 48349112168     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69733-6_14     Document Type: Conference Paper

References (14)

1. Alon, N., Yuster, R., Zwick, U.: Color-Coding. Journal of the ACM 42, 844-856 (1995)
2. Arkin, E., Hassin, R.: Approximating Weighted Set Packing by Local Search. Math. Oper. Res. 24, 640-648 (1998)
3. Bafna, V., Narayan, B., Ravi, R.: Nonoverlapping Local Alignments (Weighted Independent Sets of Axis-Parallel Rectangles). Discrete Appl. Math., 41-53 (1996)
4. Berman, P.: A d/2 Approximation for Maximum Weight Independent Set in d-claw Free Graphs. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 214-219. Springer, Heidelberg (2000)
5. Chandra, B., Halldorsson, M.M.: Greedy Local Improvement and Weighted Set Packing Approximation. Journal of Algorithms 39, 223-240 (2001)
6. Chandra, B., Halldorsson, M.M.: Approximating Weighted Set Packing by Local Search. Journal of Algorithms, 223-240 (2001)
7. Chen, J., Lu, S.: Improved Parameterized Set Splitting Algorithms: a Probabilistic Approach. Algorithmica (to appear, 2008)
8. Chen, J., Lu, S., Zhang, F.: Improved Algorithms for Path, Matching, and Packing Problems. In: Proc. of SODA 2007, pp. 298-307 (2007)
9. Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)
10. Fellows, M.R., 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)
11. Liu, Y., Chen, J., Wang, J.: On Efficient FPT 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)
12. 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)
13. Naor, M., Schulman, L., Srinivasan, A.: Splitters and Near-Optimal Derandomization. In: FOCS 1995, pp. 182-190 (1995)
14. 3k) Parameterized Algorithm for 3-Set Packing. In: Proc. of TAMC 2008 (to appear, 2008)