790 search results - page 20 / 158 » Subexponential Parameterized Algorithms |
123
Voted
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
154
click to vote
IJCM
2008
15 years 6 months ago
2008
Abstract. We analyze Roman domination from a parameterized perspective. More specifically, we prove that this problem is W[2]-complete for general graphs. However, parameterized al...
142
Voted
ECCC
2007
15 years 6 months ago
2007
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
137
click to vote
TCAD
2008
15 years 6 months ago
2008
Abstract--This paper presents a multiparameter momentmatching-based model order reduction technique for parameterized interconnect networks via a novel two-directional Arnoldi proc...
188
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
We prove that weighted monotone/antimonotone circuit satisfiability has no fixed-parameter tractable approximation algorithm with any approximation ratio function ρ, unless FPT...