Skip to main content
SpringerLink
Log in
Book cover

International Conference on Theory and Applications of Models of Computation

TAMC 2009: Theory and Applications of Models of Computation pp 211–220Cite as

Improved Deterministic Algorithms for Weighted Matching and Packing Problems

  • Conference paper

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

Abstract

For the weighted rD-Matching problem, we present a deterministic parameterized algorithm with time complexity O *(4(r − 1)k), improving the previous best upper bound O *(4rk). In particular, the algorithm can be applied to solve the unweighted 3D-Matching problem with time O *(16k), improving the previous best result O *(21.26k). For the weighted r-Set Packing problem, we present a deterministic parameterized algorithm with time complexity O *(2(2r − 1)k), improving the previous best result O *(22rk). The algorithm, when applied to the unweighted 3-Set Packing problem, has running time O *(32k), improving the previous best result O *(43.62k). Moreover, for the weighted rD-Matching and weighted r-Set Packing problems, we get a kernel of size O(k r).

This work is supported by the National Natural Science Foundation of China (No. 60773111), the National Grand Fundamental Research 973 Program of China (No. 2008CB317107), the Excellent Youth Foundation of Hunan province of China (No. 06JJ10009), Program for New Century Excellent Talents in University (No. NCET-O5-0683) and Program for Changjiang Scholars and Innovative Research Team in University (No. IRT0661).

This is a preview of subscription content, 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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)

    Google Scholar 

  2. Liu, Y., Chen, J., Wang, J.: On efficient FPT algorithms for weighted matching and packing problems. In: Proc. 4th Ann. Conference on Theory and Applications of Models of Computation (TAMC 2007). LNCS, vol. 4484, pp. 575–586 (2007)

    Google Scholar 

  3. Wang, J., Feng, Q.: Improved parameterized algorithms for weighted 3-set packing. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 130–139. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Chen, J., Kneis, J., Lu, S., Mölle, D., Richter, S., Rossmanith, P., Sze, S., Zhang, F.: Randomized divide-and-conquer: improved path, matching, and packing algorithms. SIAM Journal on Computing (to appear)

    Google Scholar 

  5. Fellows, M., 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)

    Google Scholar 

  6. Chen, J., Friesen, D., Jia, W., Kanj, I.: Using nondeterminism to design efficient deterministic algorithms. Algorithmica 40, 83–97 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Jia, W., Zhang, C., Chen, J.: An efficient parameterized algorithm for m-set packing. Journal of Algorithms 50, 106–117 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. Koutis, I.: A faster parameterized algorithm for set packing. Information Processing Letters 94, 7–9 (2005)

    Article  MathSciNet  Google Scholar 

  9. 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)

    Chapter  Google Scholar 

  10. Wang, J., Feng, Q.: An O *(3.523k) parameterized algorithm for 3-set packing. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 82–93. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Koutis, I.: Faster algebraic algorithms for path and packing problems. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 575–586. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Williams, R.: Finding paths of length k in O*(2k) time, arXiv:0807.3026v2 [cs.DS] (2008)

    Google Scholar 

  13. Naor, M., Schulman, L., Srinivasan, A.: Splitters and near-optimal derandomization. In: Proc. 39th Annual Symposium on Foundatins of Computer Science (FOCS 1995), pp. 182–190 (1995)

    Google Scholar 

  14. Fredman, M., Komlos, J., Szemeredi, E.: Storing a sparse table with O(1) worst case access time. Journal of the ACM 31, 538–544 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  15. Shoup, V.: A Computational Introduction to Number Theory and Algebra, 2nd edn. Cambridge Univesity Press, New York (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Engineering, Central South University, Changsha, 410083, P.R. China

    Qilong Feng & Jianxin Wang

  2. Department of Computer Science and Engineering, Texas A&M University, College Station, Texas, 77843-3112, USA

    Yang Liu & Songjian Lu

Authors
  1. Qilong Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Songjian Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jianxin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Texas A&M University, College Station, 77843, Texas, USA

    Jianer Chen

  2. School of Mathematics, University of Leeds, LS2 9JT, U.K.

    S. Barry Cooper

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Feng, Q., Liu, Y., Lu, S., Wang, J. (2009). Improved Deterministic Algorithms for Weighted Matching and Packing Problems. In: Chen, J., Cooper, S.B. (eds) Theory and Applications of Models of Computation. TAMC 2009. Lecture Notes in Computer Science, vol 5532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02017-9_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02017-9_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02016-2

  • Online ISBN: 978-3-642-02017-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation