Results 1  10
of
112,492
Fixedparameter tractability and completeness
, 1992
"... For many fixedparameter problems that are trivially solvable in polynomialtime, such as kDominating Set, essentially no better algorithm is presently known than the one which tries all possible solutions. Other problems, such as kFeedback Vertex Set, exhibit fixedparameter tractability: for eac ..."
Abstract

Cited by 53 (6 self)
 Add to MetaCart
For many fixedparameter problems that are trivially solvable in polynomialtime, such as kDominating Set, essentially no better algorithm is presently known than the one which tries all possible solutions. Other problems, such as kFeedback Vertex Set, exhibit fixedparameter tractability
Fixedparameter tractability and logic
 In preparation
, 1999
"... We exhibit a close connection between parameterized complexity theory and logic. Our approach is that of descriptive complexity theory. We study the definability of parameterized problems and try to obtain information about the parameterized complexity of the problems through the syntactical structu ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
structure of the defining sentences. On the one hand, we use this approach to prove that certain problems are fixedparameter tractable because they can be defined by syntactically simple formulas. On the other hand, we characterize classes of intractable problems by syntactical means. 1
DIRECTED GRAPHS: FIXEDPARAMETER TRACTABILITY & BEYOND
, 2014
"... Most interesting optimization problems on graphs are NPhard, implying that (unless P = NP) there is no polynomial time algorithm that solves all the instances of an NPhard problem exactly. However, classical complexity measures the running time as a function of only the overall input size. The pa ..."
Abstract
 Add to MetaCart
plexity is to design efficient algorithms for NPhard problems when the parameter k is small, even if the input size is large. Formally, we say that a parameterized problem is fixedparameter tractable (FPT) if instances of size n and parameter k can be solved in f (k) · nO(1) time, where f is a computable function
Fixedparameter
"... tractable canonization and isomorphism test for graphs of bounded treewidth∗ ..."
Abstract
 Add to MetaCart
tractable canonization and isomorphism test for graphs of bounded treewidth∗
Fixedparameter
"... tractable canonization and isomorphism test for graphs of bounded treewidth∗ ..."
Abstract
 Add to MetaCart
tractable canonization and isomorphism test for graphs of bounded treewidth∗
Fixedparameter algorithms for . . .
, 2003
"... FestparameterAlgorithmen bieten einen konstruktiven Ansatz zur Losung von kombinatorisch schwierigen, in der Regel NPharten Problemen, der zwei Ziele berucksichtigt: innerhalb von beweisbaren Laufzeitschranken werden optimale Ergebnisse berechnet. Die entscheidende Idee ist dabei, einen oder mehr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
mehrere Aspekte der Problemeingabe als Parameter der Problems aufzufassen und die kombinatorische Explosion der algorithmischen Schwierigkeit auf diese Parameter zu beschranken, so dass die Laufzeitkosten polynomiell in Bezug auf den nichtparametrisierten Teil der Eingabe sind. Gibt es einen
Bounded FixedParameter Tractability and Reducibility
, 2007
"... We study a refined framework of parameterized complexity theory where the parameter dependence of fixedparameter tractable algorithms is not arbitrary, but restricted by a function in some family F. For every family F of functions, this yields a notion of Ffixed parameter tractability. If F is the ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We study a refined framework of parameterized complexity theory where the parameter dependence of fixedparameter tractable algorithms is not arbitrary, but restricted by a function in some family F. For every family F of functions, this yields a notion of Ffixed parameter tractability. If F
Minimizing Movement: FixedParameter Tractability
"... Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these problems involve planning the coordinated motion of a collection of agents (representing robots, people, map labels, network m ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
inapproximability. Given that the number of mobile agents is typically much smaller than the complexity of the environment, we turn to fixedparameter tractability. We characterize the boundary between tractable and intractable movement problems in a very general set up: it turns out the complexity of the problem
Results 1  10
of
112,492