1554 search results - page 1 / 311 » Parameterized Complexity and Approximation Algorithms |
ECCC
2007
15 years 1 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 ...
61
Voted
CJ
2008
15 years 1 months ago
2008
125
Voted
TAMC
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
113
Voted
FCT
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
102
Voted
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...