194 search results - page 6 / 39 » The Parameterized Complexity of Some Minimum Label Problems |
120
Voted
COCOON
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
125
Voted
STACS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
95
Voted
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
95
Voted
COCOON
2006
Springer
15 years 4 months ago
2006
Springer
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
101
Voted
TAMC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...