Using Nondeterminism to Design Deterministic Algorithms

Authors:
Jianer Chen;Donald K. Friesen;Weijia Jia;Iyad Kanj
Affiliations:
-;-;-;-
Venue:
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2001

Citing 4
Cited 2

Maximum bounded 3-dimensional matching is MAX SNP-complete

Information Processing Letters
Concrete Mathematics: A Foundation for Computer Science

Concrete Mathematics: A Foundation for Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Graph Theory With Applications

Graph Theory With Applications

Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Improved Exact Algorithms for MAX-SAT

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

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)kn) 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.