Iterative Expansion and Color Coding
- Additional Document Info
- View All
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.80 3k), improving a long list of previous algorithms for the problem. © 2012 ACM.
author list (cited authors)
Chen, J., Liu, Y., Lu, S., Sze, S., & Zhang, F.