6 search results - page 1 / 2 » Fixed-Parameter Intractability |
COCO
1992
Springer
13 years 9 months ago
1992
Springer
We give a novel characterization of W[1], the most important fixed-parameter intractability class in the W-hierarchy, using Boolean circuits that consist solely of majority gates. ...
KR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are intractable but several tractable fragments have be...
ALGORITHMICA
2010
13 years 5 months ago
2010
The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work...
ESA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
SIAMCOMP
2010
12 years 12 months ago
2010
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...