Using Nondeterminism to Design Efficient Deterministic Algorithms

Authors:
Jianer Chen;Donald K. Firesen;Weijia Jia;Iyad A. Kanj
Affiliations:
Department of Computer Science, Texas A & M University, College Station, TX 77843-3112, USA;Department of Computer Science, Texas A & M University, College Station, TX 77843-3112, USA;Department of Computer Engineering and Information Technology, City University of HongKong, Kowloon, Hong Kong SAR, China;School of CTI, DePaul University, 243 S. Wabash Avenue, Chicago, IL 60604-2301, USA
Venue:
Algorithmica
Year:
2004

Citing 0
Cited 8

Improved algorithms for path, matching, and packing problems

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Deterministic Algorithms for Weighted Matching and Packing Problems

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Randomized disposal of unknowns and implicitly enforced bounds on parameters

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
An O*(3.533k)-time parameterized algorithm for the 3-set packing problem

Theoretical Computer Science
Improved deterministic algorithms for weighted matching and packing problems

Theoretical Computer Science
Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems

Theoretical Computer Science
Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching

ACM Transactions on Algorithms (TALG)
Greedy localization and color-coding: improved matching and packing algorithms

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation

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