Abstract
We study the parameterized complexity of a generalized matching problem, the P 2-packing problem. The problem is NP-hard and has been studied by a number of researchers. In this paper, we provide further study of the structures of the P 2-packing problem, and propose a new kernelization algorithm that produces a kernel of size 7k for the problem, improving the previous best kernel size 15k. The new kernelization leads to an improved algorithm for the problem with running time O *(24.142 k), improving the previous best algorithm of time O *(25.301 k).
This work is in part supported by the National Natural Science Foundation of China under Grant No. 60773111 and No. 60433020, Provincial Natural Science Foundation of Hunan (06JJ10009), the Program for New Century Excellent Talents in University No. NCET-05-0683 and the Program for Changjiang Scholars and Innovative Research Team in University No. IRT0661.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hell, P.: Graph Packings. Electronic Notes in Discrete Mathematics 5 (2000)
Kirkpatrick, D.G., Hell, P.: On the complexity of general graph factor problems. SIAM J. Comput. 12, 601–609 (1983)
Kann, V.: Maximum bounded H-matching is MAX-SNP-complete. J. nform. Process. Lett. 49, 309–318 (1994)
Hurkens, C., Schrijver, A.: On the size of systems of sets every t of which have an SDR, with application to worst case ratio of Heuristics for packing problems. ISIAM J. Discrete Math. 2, 68–72 (1989)
Fellows, M., Heggernes, P., Rosamond, F., Sloper, C., Telle, J.A.: Exact algorithms for finding k disjoint triangles in an arbitrary graph. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 235–244. Springer, Heidelberg (2004)
Mathieson, L., Prieto, E., Shaw, P.: Packing edge disjoint triangles: a parameterized view. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 127–137. Springer, Heidelberg (2004)
Prieto, E., Sloper, C.: Look at the stars. Theoretical Computer Science 351, 437–445 (2006)
Chen, J.: Parameterized computation and complexity: a new approach dealing with NP-hardness. Journal of Computer Science and Technology 20, 18–37 (2005)
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., Ning, D., Feng, Q., Chen, J. (2008). An Improved Parameterized Algorithm for a Generalized Matching Problem. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2008. Lecture Notes in Computer Science, vol 4978. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79228-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-79228-4_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79227-7
Online ISBN: 978-3-540-79228-4
eBook Packages: Computer ScienceComputer Science (R0)