Using Nondeterminism to Design Efficient Deterministic Algorithms
In this paper, we illustrate how nondeterminism can be used conveniently and effectively in designing efficient deterministic algorithms. In particular, our method gives an O((5.7k)k n) parameterized algorithm for the 3-D matching problem, which significantly improves the previous algorithm by Downey, Fellows, and Koblitz. 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.
KeywordsBipartite Graph Match Problem Vertex Cover Deterministic Algorithm Maximal Match
Unable to display preview. Download preview PDF.
- 1.J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, North-Holland, New York, 1976.Google Scholar
- 2.J. Chen, I. A. Kanj, and W. Jia, “Vertex Cover: further observations and further improvements,” in Proc. 25th Int. Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol. 1665, pp. 313–324, Ascona, Switzerland, June 1999.Google Scholar
- 3.J. Chen, D. K. Friesen, W. Jia, and I. A. Kanj, “Using nondeterminism to design efficient deterministic algorithms,” Technical Report, Department of Computer Science, Texas A&M University, College Station, Texas, May 2001.Google Scholar
- 4.R. G. Downey and M. R. Fellows, Parameterized Complexity, New York, New York: Springer, (1999), pp. 220–222.Google Scholar