Results 11 to 20 of about 5,303 (261)

Imbalance is fixed parameter tractable [PDF]

open access: yesInformation 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]

open access: yesACM 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 ...
Michael R. Fellows   +5 more
openaire   +2 more sources

Minimum Bisection Is Fixed-Parameter Tractable [PDF]

open access: yesSIAM Journal on Computing, 2014
In the classic Minimum Bisection problem we are given as input an undirected 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]

open access: yesSIAM Journal on Discrete Mathematics, 2019
We consider the following natural “above-guarantee” parameterization of the classical Longest Path problem: For given vertices $s$ and $t$ of a graph $G$ and integer $k$, the Longest Detour problem asks for an $(s,t)$-path in $G$ that is at least $k$ longer than a shortest $(s,t)$-path. Using insights into structural graph theory, we prove that Longest
Ivona Bezáková   +3 more
openaire   +8 more sources

Interval Deletion Is Fixed-Parameter Tractable [PDF]

open access: yesACM 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 of n vertices into an interval graph. We present a parameterized algorithm of runtime 10 k ⋅ n
Yixin Cao 0001, Dániel Marx
openaire   +7 more sources

Rotation distance is fixed-parameter tractable [PDF]

open access: yesInformation Processing Letters, 2009
Rotation distance between trees measures the number of simple operations it takes to transform one tree into another. There are no known polynomial-time algorithms for computing rotation distance. In the case of ordered rooted trees, we show that the rotation distance between two ordered trees is fixed-parameter tractable, in the parameter, k, the ...
Sean Cleary, Katherine St. John
openaire   +4 more sources

Jungles, bundles, and fixed-parameter tractability [PDF]

open access: yesProceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
The new version contains simplified proofs providing better running times of the algorithms, as well as a wider discussion of the ...
Fedor V. Fomin, Michal Pilipczuk
openaire   +4 more sources

Optimal Discretization is Fixed-parameter Tractable [PDF]

open access: yes, 2021
Given two disjoint sets $W_1$ and $W_2$ of points in the plane, the Optimal Discretization problem asks for the minimum size of a family of horizontal and vertical lines that separate $W_1$ from $W_2$, that is, in every region into which the lines partition the plane there are either only points of $W_1$, or only points of $W_2$, or the region is empty.
Stefan Kratsch   +4 more
openaire   +4 more sources

Minimizing Movement: Fixed-Parameter Tractability [PDF]

open access: yesACM Transactions on Algorithms, 2009
We study an extensive class of movement minimization problems that 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 messages, etc.) to achieve a global property in the network while ...
Erik D. Demaine   +2 more
openaire   +8 more sources

Chordal Editing is Fixed-Parameter Tractable [PDF]

open access: yesAlgorithmica, 2015
Graph modification problems are typically asked as follows: is there a small set of operations that transforms a given graph to have a certain property. The most commonly considered operations include vertex deletion, edge deletion, and edge addition; for the same property, one can define significantly different versions by allowing different ...
Yixin Cao 0001, Dániel Marx
openaire   +7 more sources

Home - About - Disclaimer - Privacy