3-dimensional matching
Generated by GPT-5-miniExpansion Funnel Raw 73 → Dedup 0 → NER 0 → Enqueued 0
| 3-dimensional matching | |
|---|---|
| Name | 3-dimensional matching |
| Field | Combinatorics, Theoretical computer science |
| Introduced | 1979 |
3-dimensional matching is a combinatorial problem in theoretical computer science and discrete mathematics that generalizes matching concepts from Graph theory, Hypergraph theory, and Combinatorics. It appears in studies of Complexity theory, Algorithm design, and practical domains such as Operations Research and Database theory. The problem connects to classical results and figures in Computer science and Mathematics including reductions used in landmark proofs and completeness classifications.
Definition
The problem is defined on three disjoint finite sets A, B, C and a set T of ordered triples drawn from the Cartesian product A × B × C; instances ask for a subset M ⊆ T that is a matching, meaning no two triples in M share a component in A, B, or C, with goals such as maximizing |M| or deciding if |M| = k for a given integer k. This formalization relates to constructions used by researchers at institutions like Bell Labs, IBM Research, Microsoft Research, and influenced work by scholars affiliated with Princeton University, Massachusetts Institute of Technology, Stanford University, and University of California, Berkeley. The definition is central to reductions in seminal papers published in venues such as Journal of the ACM, SIAM Journal on Computing, IEEE Symposium on Foundations of Computer Science, and ACM Symposium on Theory of Computing.
Computational Complexity
3-dimensional matching is one of Karp’s 21 NP-complete problems and is NP-complete in its decision form under standard reductions; it was established in results contemporaneous with foundational work at Bell Labs and reported in conferences like FOCS and STOC. The optimization variant of maximizing the matching size is NP-hard and APX-hard in many formulations, with hardness proofs invoking techniques related to reductions from 3-SAT, Vertex Cover, Set Packing, and Exact Cover by 3-Sets. Complexity classifications reference frameworks developed by researchers at Carnegie Mellon University, Harvard University, and University of Cambridge, and connect to hardness-of-approximation results from groups at ETH Zurich and University of Toronto.
Algorithms and Approaches
Exact algorithms for small instances use backtracking, branching, and inclusion–exclusion methods implemented by teams at University of Warsaw and Weizmann Institute of Science; fixed-parameter tractable approaches parameterized by k or structural width exploit ideas from Parameterized complexity research at University of Edinburgh and University of Illinois Urbana-Champaign. Approximation algorithms and greedy heuristics have been studied by researchers at California Institute of Technology and New York University; linear programming relaxations, integer programming formulations, and rounding schemes have connections to work at Columbia University and Cornell University. Heuristic and practical methods leverage network-flow analogies inspired by contributions from Princeton Plasma Physics Laboratory and algorithm engineering groups at Max Planck Institute for Informatics and ETH Zurich.
Applications
Instances and variants of 3-dimensional matching model problems in Bioinformatics groups at Broad Institute and European Bioinformatics Institute, including haplotype assembly and phylogenetic reconstruction studied by teams at University of Cambridge and University College London. In Database theory and Information retrieval research from Oracle Corporation and Google Research, it models join operations and data integration tasks. Scheduling and resource-allocation formulations appear in applied work at MIT Lincoln Laboratory, Los Alamos National Laboratory, and Airbus research collaborations. Industrial and economic problems studied by researchers at McKinsey & Company and AT&T map to matching constraints; related use cases appear in publications from Royal Society and project reports at National Science Foundation.
Variants and Generalizations
Variants include the 3-dimensional perfect matching problem, the k-dimensional matching generalization studied in combinatorics groups at University of Chicago and Yale University, and constrained versions with capacities or weights explored by research groups at Siemens and Bell Labs Research. Generalizations lead to hypergraph matching problems and set-packing formulations considered by scholars at University of Oxford and Imperial College London. Problems combining elements of 3-dimensional matching with temporal or stochastic constraints have been investigated in interdisciplinary centers such as Santa Fe Institute and Centre National de la Recherche Scientifique.
Examples and Instances
Concrete small instances are used in textbooks and courses at institutions like Massachusetts Institute of Technology and Stanford University to illustrate NP-completeness reductions from 3-SAT and Exact Cover by 3-Sets; benchmark instances and synthetic datasets appear in repositories maintained by research groups at University of California, Los Angeles and Duke University. Classic example constructions appear in surveys and monographs authored by faculty at Rutgers University, University of Michigan, and University of Texas at Austin and are discussed in tutorial lectures at International Conference on Integer Programming and Combinatorial Optimization and workshops hosted by Association for Computing Machinery.