1554 search results - page 6 / 311 » Parameterized Complexity and Approximation Algorithms |
TAMC
2009
Springer
14 years 1 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
COCOON
2006
Springer
13 years 11 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...
ALGORITHMICA
2008
13 years 7 months ago
2008
MST
2007
13 years 7 months ago
2007
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
ESA
2004
Springer
14 years 24 days ago
2004
Springer
