Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

IWPEC
2004
Springer

favoriteEmaildiscussreport

113views Applied Computing» more IWPEC 2004»

On Miniaturized Problems in Parameterized Complexity Theory

13 years 9 months ago

On Miniaturized Problems in Parameterized Complexity Theory

Download www2.informatik.hu-berlin.de

Abstract. We introduce a general notion of miniaturization of a problem that comprises the diﬀerent miniaturizations of concrete problems considered so far. We develop parts of the basic theory of miniaturizations in this general framework. Using the appropriate logical formalism, we show that the miniaturization of a deﬁnable problem in W[t] lies in W[t], too. In particular, the miniaturization of the dominating set problem is in W[2].

Yijia Chen, Jörg Flum

Real-time Traffic

Appropriate Logical Formalism | Dominating Set Problem | IWPEC 2004 | Miniaturization |

claim paper

Related Content

» Subexponential Time and FixedParameter Tractability Exploiting the Miniaturization Mapping

» An Isomorphism between Subexponential and Parameterized Complexity Theory

» Bounded Nondeterminism and Alternation in Parameterized Complexity Theory

» Easy and hard coalition resource game formation problems a parameterized complexity analys...

» Parameterizing the winner determination problem for combinatorial auctions

» On Parameterized Approximability

» A Parameterized View on Matroid Optimization Problems

» Parameterized Approximability of the Disjoint Cycle Problem

» The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Si...

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	IWPEC
Authors	Yijia Chen, Jörg Flum

Comments (0)