Results 11 to 20 of about 2,616,817 (282)
Bounded Fixed-Parameter Tractability and Reducibility [PDF]
Annals of Pure and Applied Logic, 2006 We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a function in some family F.
Flum, Jörg +7 more
core +3 more sources
Minimizing movement: Fixed-parameter tractability [PDF]
ACM Transactions on Algorithms, 2009 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 ...
Hajiaghayi, Mohammad Taghi +5 more
core +9 more sources
Fixed-parameter tractability, definability, and model checking [PDF]
SIAM Journal on Computing, 2001 In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fragments of first-order logic as ...
Flum, Jörg +3 more
core +5 more sources
Interval Deletion Is Fixed-Parameter Tractable [PDF]
ACM Transactions on Algorithms, 2013 We study the minimum interval deletion problem, which asks for the removal of a set of at most k vertices to make a graph on n vertices into an interval graph.
Cao, Y. +5 more
core +8 more sources
Fixed-Parameter Tractability of Hedge Cut [PDF]
In the Hedge Cut problem, the edges of a graph are partitioned into groups called hedges, and the question is what is the minimum number of hedges to delete to disconnect the graph. Ghaffari, Karger, and Panigrahi [SODA 2017] showed that Hedge Cut can be
Lokshtanov, Daniel +4 more
core +7 more sources
Almost 2-SAT is fixed-parameter tractable [PDF]
Journal of Computer and System Sciences, 2009 We consider the following problem. Given a 2-cnf formula, is it possible to remove at most k clauses so that the resulting 2-cnf formula is satisfiable?
Razgon, Igor +2 more
core +6 more sources
Imbalance is fixed parameter tractable [PDF]
Information Processing Letters, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel Lokshtanov +2 more
openaire +2 more sources
Distortion Is Fixed Parameter Tractable [PDF]
ACM Transactions on Computation Theory, 2009 We study low-distortion embedding of metric spaces into the line, and more generally, into the shortest path metric of trees, from the parameterized complexity perspective. Let M = M ( G ) be the shortest path metric of an edge-weighted graph G ,
Michael R. Fellows +5 more
openaire +2 more sources
Minimum Bisection Is Fixed-Parameter Tractable [PDF]
SIAM Journal on Computing, 2014 In the classic Minimum Bisection problem we are given as input a graph $G$ and an integer $k$. The task is to determine whether there is a partition of $V(G)$ into two parts $A$ and $B$ such that $||A|-|B|| \leq 1$ and there are at most $k$ edges with one endpoint in $A$ and the other in $B$.
Marek Cygan +4 more
openaire +7 more sources
Finding Detours is Fixed-Parameter Tractable [PDF]
SIAM Journal on Discrete Mathematics, 2019 Extended abstract appears at ICALP ...
Ivona Bezáková +3 more
openaire +7 more sources