Randomized disposal of unknowns and implicitly enforced bounds on parameters

Abstract

We study two algorithmic techniques that have turned out to be useful in the recent development of parameterized algorithms: randomized disposal of a small unknown subset of a given universal set, and implicitly enforced bounds on parameters in a branch-and-search process. These techniques are simple, effective, and have led to improved algorithms for a number of well-known parameterized problems. © 2008 Springer-Verlag Berlin Heidelberg.