Abstract
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.
Supported in part by the National Science Foundation under Grants CCR- 9613805, and CCR-0000206. Part of the work was done while this author was visiting City University of Hong Kong.
Supported in part by UGC of Hong Kong under Grant 9040228.
Corresponding author.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, North-Holland, New York, 1976.
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.
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.
R. G. Downey and M. R. Fellows, Parameterized Complexity, New York, New York: Springer, (1999), pp. 220–222.
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, Addison-Wesley, Reading, 1994.
J. E. Hopcroft and R. M. Karp, An n 5/2 algorithm for maximum matching in bipartite graphs, SIAM J.Comput. 2, (1973), pp. 225–231.
V. Kann, Maximum bounded 3-dimensional matching is MAX SNP-complete, Information Processing Letters 37, (1991), pp. 27–35.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, J., Friesen, D.K., Jia, W., Kanj, I.A. (2001). Using Nondeterminism to Design Efficient Deterministic Algorithms. In: Hariharan, R., Vinay, V., Mukund, M. (eds) FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2001. Lecture Notes in Computer Science, vol 2245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45294-X_11
Download citation
DOI: https://doi.org/10.1007/3-540-45294-X_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43002-5
Online ISBN: 978-3-540-45294-2
eBook Packages: Springer Book Archive