Skip to main content
SpringerLink
Log in

Improved Algorithms for Several Parameterized Problems Based on Random Methods

  • Conference paper
  • First Online:
Frontiers in Algorithmics (FAW 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9711))

Included in the following conference series:

  • 617 Accesses

Abstract

In this paper, we apply random methods to solve several NP-hard problems. For the Weighted \(P_3\)-Packing problem, by randomly partitioning the vertices in given graph, a randomized parameterized algorithm of running time \(O^*(32^k)\) is given. For the Weighted Load Coloring problem, a randomized parameterized algorithm of running time \(O^*(11.32^k)\) is presented. For the Claw-free Edge Deletion problem on diamond-free graphs, a parameterized algorithm of running time \(O^*(2.895^k)\) is given.

This work is supported by the National Natural Science Foundation of China under Grants (61232001, 61472449, 61572190, 61420106009).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ahuja, N., Baltz, A., Doerr, B., Privtivy, A., Srivastav, A.: On the minimum load coloring problem. J. Discrete Algorithms 5(3), 533–545 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bar-Yehuda, R., Halldórsson, M., Naor, J., Shachnai, H., Shapira, I.: Scheduling split intervals. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 732–741 (2002)

    Google Scholar 

  3. Binkele-Raible, D., Fernau, H.: Packing paths: recycling saves time. Discrete Appl. Math. 161, 1686–1689 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  4. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Narrow sieves for parameterized paths and packings (2010). CoRR abs/1007.1161

    Google Scholar 

  5. Chen, J., Feng, Q., Liu, Y., Lu, S., Wang, J.: Improved deterministic algorithms for weighted matching and packing problems. Theoret. Comput. Sci. 412(23), 2503–2512 (2011)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Chen, J., Lu, S., Sze, S.H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 298–307 (2007)

    Google Scholar 

  8. Cygan, M., Pilipczuk, M., Pilipczuk, M., Leeuwen, E., Wrochna, E.: Polynomial kernelization for removing induced claws and diamonds (2015). arXiv preprint arXiv:1503.00704

  9. Fellows, M., Heggernes, P., Rosamond, F.A., Sloper, C., Telle, J.A.: 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)

    Chapter  Google Scholar 

  10. Gabow, H.: Data structures for weighted matching and nearest common ancestoers. In: Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 434–443 (1990)

    Google Scholar 

  11. Gutin, G., Jones, M.: Parameterized algorithms for load coloring problem. Inf. Process. Lett. 114, 446–449 (2014)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. Hell, P., Kirkpatrick, D.: On the complexity of a generalized matching problem. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 240–245 (1978)

    Google Scholar 

  14. 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. SIAM J. Discrete Math. 2, 68–72 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kann, V.: Maximum bounded \(H\)-matching is MAX-SNP-complete. Inf. Process. Lett. 49, 309–318 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kirkpatrick, D.G., Hell, P.: On the complexity of general graph factor problems. SIAM J. Comput. 12, 601–609 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  17. Marx, D., Razgon, I.: Fixed-parameter tractability of multicut parameterized by the size of the cutset. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, pp. 469–478 (2011)

    Google Scholar 

  18. Marx, D.: Randomized techniques for parameterized algorithms. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol. 7535, p. 2. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  19. Zehavi, M.: Deterministic parameterized algorithms for matching and packing problems (2013). arXiv:1311.0484v2

Download references

Author information

Authors and Affiliations

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

    Qilong Feng, Xiong Jiang & Jianxin Wang

Authors
  1. Qilong Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiong Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jianxin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qilong Feng .

Editor information

Editors and Affiliations

  1. Shandong University, Jinan, China

    Daming Zhu

  2. MS EC-31, University of Texas at Dallas, Richardson, Texas, USA

    Sergey Bereg

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Feng, Q., Jiang, X., Wang, J. (2016). Improved Algorithms for Several Parameterized Problems Based on Random Methods. In: Zhu, D., Bereg, S. (eds) Frontiers in Algorithmics. FAW 2016. Lecture Notes in Computer Science(), vol 9711. Springer, Cham. https://doi.org/10.1007/978-3-319-39817-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-39817-4_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-39816-7

  • Online ISBN: 978-3-319-39817-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation