Abstract
We study several versions of parameterized enumeration. The idea is always to have an algorithm which outputs all solutions (in a certain sense) to a given problem instance. Such an algorithm will be analysed from the viewpoint of parameterized complexity. We show how to apply enumeration techniques in a number of examples. In particular, we give a fixed parameter algorithm for the reconfiguration of faulty chips when providing so-called shared and linked spares.
Cite
CITATION STYLE
Fernau, H. (2002). On parameterized enumeration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2387, pp. 564–573). Springer Verlag. https://doi.org/10.1007/3-540-45655-4_60
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
