skip to main content
research-article

Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching

Published: 01 January 2012 Publication History

Abstract

The research in the parameterized 3d-matching problem has yielded a number of new algorithmic techniques and an impressive list of improved algorithms. In this article, a new deterministic algorithm for the problem is developed that integrates and improves a number of known techniques, including greedy localization, dynamic programming, and color coding. The new algorithm, which either constructs a matching of k triples in a given triple set or correctly reports that no such a matching exists, runs in time O*(2.803k), improving a long list of previous algorithms for the problem.

References

[1]
Alon, N. and Gutner, S. 2009. Balanced hashing, color coding and approximate counting. Electronic Colloquium on Computational Complexity. Report No. 12.
[2]
Alon, N., Yuster, R., and Zwick U. 1995. Color-coding. J. ACM 42, 844--856.
[3]
Carter, J., and Wegman M. 1979. Universal classes of hash functions. J. Comput. Syst. Sci. 18, 143--154.
[4]
Chen, J., Friesen, D., Jia, W., and Kanj, I. 2004. Using nondeterminism to design deterministic algorithms. Algorithmica 40, 83--97.
[5]
Chen, J., Lu, S., Sze, S.-H., and Zhang, F. 2007. Improved algorithms for path, matching, and packing problems. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’07). 298--307.
[6]
Dehne, F., Fellows, M., Rosamond, F., and Shaw, P. 2004. Greedy localization, iterative compression, modeled crown reductions: New FPT techniques, and improved algorithm for set splitting, and a novel 2k kernelization of vertex cover. In Proceedings of the International Workshop on Parameterized and Exact Computation (IWPEC’04). Lecture Notes in Computer Science, vol. 3162, Springer-Verlag, Berlin, 271--280.
[7]
Downey, R., and Fellows, M. 1999. Parameterized Complexity. Springer, New York.
[8]
Fellows, M., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D., and Whitesides, S. 2008. Faster fixed-parameter tractable algorithms for matching and packing problems. Algorithmica 52, 167--176.
[9]
Fredman, M., Komlos, J., and Szemeredi, E. 1984. Storing a sparse table with O(1) worst case access time. J. ACM 31, 538--544.
[10]
Garey, M., and Johnson, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York.
[11]
Hardy, G., and Wright, E. 1978. An Introduction to the Theory of Numbers 5th Ed. Oxford University Press, Oxford, UK.
[12]
Jia, W., Zhang, C., and Chen, J. 2004. An efficient parameterized algorithm for m-set packing. J. Algorithms 50, 106--117.
[13]
Kneis, J., Molle, D., Richter, S., and Rossmanith, P. 2006. Divide-and-color. In Proceedings of the International Workshop on Graph-Theoretic Concept in Computer Science (WC’06). Lecture Notes in Computer Science, vol. 4271, Springer-Verlag, Berlin, 58--67.
[14]
Koutis, I. 2005. A faster parameterized algorithm for set packing. Inf. Process. Lett. 94, 7--9.
[15]
Koutis, I. 2008. Faster algebraic algorithms for path and packing problems. In Proceedings of the 35th International Colloquium on Automata, Languages, and Programming (ICALP’08). Lecture Notes in Computer Science, vol. 5125, Springer-Verlag, Berlin, 575--586.
[16]
Liu, Y., Lu, S., Chen, J., and Sze, S.-H. 2006. Greedy localization and color-coding: Improved matching and packing algorithms. In Proceedings of the International Workshop on Parameterized and Exact Computation (IWPEC’06). Lecture Notes in Computer Science, vol. 4169, Springer-Verlag, Berlin, 84--95.
[17]
Reed, B., Smith, K., and Vetta, A. 2004. Finding odd cycle transversals. Oper. Res. Letters 32, 299--301.
[18]
Schmidt, J., and Siegel, A. 1990. The spatial complexity of oblivious k-probe hash functions. SIAM J. Comput. 19, 775--786.
[19]
Wang, J., and Feng, Q. 2008. An O *(3.523 k) parameterized algorithm for 3-set packing. In Proceedings of the 5th International Conference on Theory and Applications of Models of Compuitation (TAMC’08). Lecture Notes in Computer Science, vol. 4978, Springer-Verlag, Berlin, 82--93.

Cited By

View all
  • (2023)Ant Colony Optimization Algorithm for Finding the Maximum Number of d-Size Cliques in a Graph with Not All m Edges between Its d PartsDependable Computer Systems and Networks10.1007/978-3-031-37720-4_23(255-264)Online publication date: 11-Aug-2023
  • (2022)An ant algorithm for the maximum number of 3-cliques in 3-partite graphsControl and Cybernetics10.2478/candc-2021-001850:2(347-358)Online publication date: 28-Jun-2022
  • (2020)An improved ant algorithm for the triple matching problemTechnical Transactions10.37705/TechTrans/e2020005(1-7)Online publication date: 13-Apr-2020
  • Show More Cited By

Index Terms

  1. Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Transactions on Algorithms
    ACM Transactions on Algorithms  Volume 8, Issue 1
    January 2012
    191 pages
    ISSN:1549-6325
    EISSN:1549-6333
    DOI:10.1145/2071379
    Issue’s Table of Contents
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 January 2012
    Accepted: 01 November 2009
    Revised: 01 August 2009
    Received: 01 November 2008
    Published in TALG Volume 8, Issue 1

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Color coding
    2. dynamic programming matching
    3. parameterized algorithms

    Qualifiers

    • Research-article
    • Research
    • Refereed

    Funding Sources

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)6
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 14 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Ant Colony Optimization Algorithm for Finding the Maximum Number of d-Size Cliques in a Graph with Not All m Edges between Its d PartsDependable Computer Systems and Networks10.1007/978-3-031-37720-4_23(255-264)Online publication date: 11-Aug-2023
    • (2022)An ant algorithm for the maximum number of 3-cliques in 3-partite graphsControl and Cybernetics10.2478/candc-2021-001850:2(347-358)Online publication date: 28-Jun-2022
    • (2020)An improved ant algorithm for the triple matching problemTechnical Transactions10.37705/TechTrans/e2020005(1-7)Online publication date: 13-Apr-2020
    • (2020)Parameterized Complexity of Independent Set in H-Free GraphsAlgorithmica10.1007/s00453-020-00730-682:8(2360-2394)Online publication date: 17-Jun-2020
    • (2019)Randomized Parameterized Algorithms for the Kidney Exchange ProblemAlgorithms10.3390/a1202005012:2(50)Online publication date: 25-Feb-2019
    • (2018)Parameterized counting matching and packing: A family of hard problems that admit FPTRASTheoretical Computer Science10.1016/j.tcs.2017.09.022734(83-93)Online publication date: Jul-2018
    • (2017)The control complexity of r -Approval: From the single-peaked case to the general caseJournal of Computer and System Sciences10.1016/j.jcss.2017.06.00489(432-449)Online publication date: Nov-2017
    • (2016)Parameterized approximation algorithms for packing problemsTheoretical Computer Science10.1016/j.tcs.2016.08.004648:C(40-55)Online publication date: 4-Oct-2016
    • (2016)The k-distinct languageTheoretical Computer Science10.1016/j.tcs.2016.01.029622:C(1-15)Online publication date: 4-Apr-2016
    • (2014)On Unknown Small Subsets and Implicit Measures: New Techniques for Parameterized AlgorithmsJournal of Computer Science and Technology10.1007/s11390-014-1474-129:5(870-878)Online publication date: 12-Sep-2014
    • Show More Cited By

    View Options

    Login options

    Full Access

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media