Abstract
Packing problems form an important class of NP-hard problems. For the weighted 3-Set Packing problem, we provide further theoretical study on the problem and present a deterministic algorithm of time O *(10.63k). Based on the randomized divide-and-conquer method, the above result can be further reduced to O *(7.563k), which significantly improves the previous best result O *(12.83k).
This work is supported by the National Basic Research 973 Program of China (2008CB317107), the National Natural Science Foundation of China under Grant (60433020, 60773111), the Program for New Century Excellent Talents in University of China under Grant (NCET-05-0683), the Program for Changjiang Scholars and Innovative Research Team in University of China under Grant (IRT0661).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Yuster, R., Zwick, U.: Color-Coding. Journal of the ACM 42, 844–856 (1995)
Arkin, E., Hassin, R.: Approximating Weighted Set Packing by Local Search. Math. Oper.Res. 24, 640–648 (1998)
Bafna, V., Narayan, B., Ravi, R.: Nonoverlapping Local Alignments (Weighted Independent Sets of Axis-Parallel Rectangles). Discrete Appl. Math., 41–53 (1996)
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)
Chandra, B., Halldorsson, M.M.: Greedy Local Improvement and Weighted Set Packing Approximation. Journal of Algorithms 39, 223–240 (2001)
Chandra, B., Halldorsson, M.M.: Approximating Weighted Set Packing by Local Search. Journal of Algorithms, 223–240 (2001)
Chen, J., Lu, S.: Improved Parameterized Set Splitting Algorithms: a Probabilistic Approach. Algorithmica (to appear, 2008)
Chen, J., Lu, S., Zhang, F.: Improved Algorithms for Path, Matching, and Packing Problems. In: Proc. of SODA 2007, pp. 298–307 (2007)
Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)
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)
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)
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)
Naor, M., Schulman, L., Srinivasan, A.: Splitters and Near-Optimal Derandomization. In: FOCS 1995, pp. 182–190 (1995)
Wang, J., Feng, Q.: An O *(3.523k) Parameterized Algorithm for 3-Set Packing. In: Proc. of TAMC 2008 (to appear, 2008)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, J., Feng, Q. (2008). Improved Parameterized Algorithms for Weighted 3-Set Packing. In: Hu, X., Wang, J. (eds) Computing and Combinatorics. COCOON 2008. Lecture Notes in Computer Science, vol 5092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69733-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-69733-6_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69732-9
Online ISBN: 978-3-540-69733-6
eBook Packages: Computer ScienceComputer Science (R0)