Randomized disposal of unknowns and implicitly enforced bounds on parameters Conference Paper

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.

name of conference

• Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings

authors

• Chen, Jianer

published proceedings

• PARAMETERIZED AND EXACT COMPUTATION, PROCEEDINGS

author list (cited authors)

• Chen, J.

citation count

• 1

complete list of authors

• Chen, Jianer

publication date

• June 2008

publisher

• Springer Nature  Publisher

published in

• Lecture Notes in Artificial Intelligence  Journal

keywords

• 46 Information And Computing Sciences

Digital Object Identifier (DOI)

• 10.1007/978-3-540-79723-4_1

International Standard Book Number (ISBN) 10

• 354079722X

International Standard Book Number (ISBN) 13

• 978-3-540-79722-7

start page

• 1

end page

• 8

volume

• 5018

URL

• http%3A%2F%2Fdx.doi.org%2F10.1007%2F978-3-540-79723-4_1