Abstract
In this paper we illustrate how nondeterminism can be used conveniently and effectively in designing efficient deterministic algorithms. In particular, our method gives a parameterized algorithm of running time O((5.7 k)k n) for the 3-D matching problem, which significantly improves the previous algorithm by Downey et al. The algorithm can be generalized to yield an improved algorithm for the r-D matching problem for any positive integer r. The method can also be employed in designing deterministic algorithms for other optimization problems as well.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Chen, J., Firesen, D., Jia, W. et al. Using Nondeterminism to Design Efficient Deterministic Algorithms. Algorithmica 40, 83–97 (2004). https://doi.org/10.1007/s00453-004-1096-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-004-1096-z