Skip to main content
SpringerLink
Log in

Randomized parameterized algorithms for \(P_2\)-Packing and Co-Path Packing problems

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

In this paper, we study the Parameterized \(P_2\)-Packing problem and Parameterized Co-Path Packing problem from random perspective. For the Parameterized \(P_2\)-Packing problem, based on the structure analysis of the problem and using random partition technique, a randomized parameterized algorithm of running time \(O^*(6.75^k)\) is obtained, improving the current best result \(O^*(8^k)\). For the Parameterized Co-Path Packing problem, we firstly study the kernel and randomized algorithm for the degree-bounded instance, where each vertex in the instance has degree at most three. A kernel of size \(20k\) and a randomized algorithm of running time \(O^*(2^k)\) are given for the Parameterized Co-Path Packing problem with bounded degree constraint. By applying iterative compression technique and based on the randomized algorithm for degree bounded problem, a randomized algorithm of running time \(O^*(3^k)\) is given for the Parameterized Co-Path Packing problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Notes

  1. Following a recent convention, for a function \(f\), we will use the notion \(O^*(f)\) for the bound \(O(f \! \cdot \! n^{O(1)})\).

References

  • Chen Z, Fellows M, Fu B, Jiang H, Liu Y, Wang L, Zhu B (2010) A Linear Kernel for Co-Path/cycle packing. In: 6th International conference on algorithmic aspects in information and management (AAIM 2010), LNCS, vol 6124, pp 90–102

  • Chen J, Lu S (2008) Improved parameterized set splitting algorithms: a probabilistic approach. Algorithmica 54(4):472–489

    Article  Google Scholar 

  • Chen J, Lu S, Sze SH, Zhang F (2007) Improved algorithms for path, matching, and packing problems. Proc. of the 17th annual ACM-SIAM symposium on discrete algorithms (SODA 07), pp 298–307

  • Chauve C, Tannier E (2008) A methodological framework for the reconstruction of contiguous regions of ancestral genomes and its application to mammalian genome. PLoS Comput Biol 4:e1000234

    Article  MathSciNet  Google Scholar 

  • De Bontridder K, Halldórsson B, Lenstra J, Ravi R, Stougie L (2003) Approximation algorithms for the test cover problem. Math Program Ser B 98:477–491

    Article  MATH  Google Scholar 

  • Fellows M, Heggernes P, Rosamond F, Sloper C, Telle JA (2004) Exact algorithms for finding \(k\) disjoint triangles in an arbitrary graph. In: Hromkovic J, Nagl M, Westfechtel B (eds) Proc. 30th workshop on graph theoretic concepts in computer science, LNCS, vol 3353. Springer, Heidelberg, pp 235–244

  • Fernau H, Raible D (2009) A parameterized perspective on packing paths of length two. J Comb Optim 18(4):319–341

    Article  MATH  MathSciNet  Google Scholar 

  • Feng Q, Wang J, Chen J (2011) Matching and \(P_2\)-Packing: weighted versions. In: 17th Annual international computing and combinatorics conference, LNCS, vol 6842, pp 343–353

  • Fujito T (1999) Approximating node-deletion problems for matroidal properties. J Algorithms 31:211227

    Article  MathSciNet  Google Scholar 

  • Hassin R, Rubinstein S (2006) An approximation algorithm for maximum triangle packing. Discret Appl Math 154:971–979

    Article  MATH  MathSciNet  Google Scholar 

  • Marx D, Razgon I (2011) Fixed-parameter tractability of multicut parameterized by the size of the cutset. In: Proceedings of the 43rd annual ACM symposium on theory of computing (STOC 2011), pp 469–478

  • Marx D (2012) Randomized techniques for parameterized algorithms. In Proceedings of the 7th international symposium on parameterized and exact computation (IPEC 2012), LNCS vol 7535, p 2

  • Prieto E, Sloper C (2006) Looking at the stars. Theor Comput Sci 351:437–445

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

This work is supported by the National Natural Science Foundation of China under Grant (61232001, 61103033, 61173051, 61370172).

Author information

Authors and Affiliations

  1. School of Information Science and Engineering, Central South University, Changsha , 410083, People’s Republic of China

    Qilong Feng, Jianxin Wang, Shaohua Li & Jianer Chen

  2. Department of Computer Science, Texas A&M University, College Station, TX, USA

    Jianer Chen

Authors
  1. Qilong Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianxin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shaohua Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jianer Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jianxin Wang.

Additional information

A preliminary version of this work was reported in the Proceedings of the 19th Annual International Computing and Combinatorics Conference, Lecture Notes in Computer Science, vol. 7936, 2013, pp. 89–100.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Feng, Q., Wang, J., Li, S. et al. Randomized parameterized algorithms for \(P_2\)-Packing and Co-Path Packing problems. J Comb Optim 29, 125–140 (2015). https://doi.org/10.1007/s10878-013-9691-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-013-9691-z

Keywords

Search

Navigation