Results 31 to 40 of about 5,303 (261)
Train Marshalling Is Fixed Parameter Tractable [PDF]
The train marshalling problem is about reordering the cars of a train using as few auxiliary rails as possible. The problem is known to be NP-complete. We show that it is fixed parameter tractable (FPT) with the number of auxiliary rails as parameter.
Leo Brueggeman +7 more
openaire +2 more sources
Co-Clustering under the Maximum Norm
Co-clustering, that is partitioning a numerical matrix into “homogeneous” submatrices, has many applications ranging from bioinformatics to election analysis. Many interesting variants of co-clustering are NP-hard.
Laurent Bulteau +3 more
doaj +1 more source
Reconstructing Generalized Staircase Polygons with Uniform Step Length
Visibility graph reconstruction, which asks us to construct a polygon that has a given visibility graph, is a fundamental problem with unknown complexity (although visibility graph recognition is known to be in PSPACE).
Nodari Sitchinava, Darren Strash
doaj +1 more source
The “Art of Trellis Decoding” Is Fixed-Parameter Tractable [PDF]
50 pages. Accepted to SODA 2016 under the title "constructive algorithms for path-width of matroids". We added several figures to improve its presentation. We found a mistake in the proof of Lemma 3.24 of the previous version.
Jeong, Jisu, Kim, Eun Jung, Oum, Sang-Il
openaire +4 more sources
Parameterized Algorithms for (r,l)-Partization
We consider the (r,l)-Partization problem of finding a set of at most k vertices whose deletion results in a graph that can be partitioned into r independent sets and l cliques.
R. Krithika, N. Narayanaswamy
doaj +1 more source
Scheduling Meets Fixed-Parameter Tractability
Fixed-parameter tractability analysis and scheduling are two core domains of combinatorial optimization which led to deep understanding of many important algorithmic questions. However, even though fixed-parameter algorithms are appealing for many reasons, no such algorithms are known for many fundamental scheduling problems.
Matthias Mnich, Andreas Wiese
openaire +3 more sources
Colored Hypergraph Isomorphism is Fixed Parameter Tractable [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arvind, V. +3 more
openaire +5 more sources
Treewidth of display graphs: bounds, brambles and applications
Phylogenetic trees and networks are leaf-labelled graphs used to model evolution. Display graphs are created by identifying common leaf labels in two or more phylogenetic trees or networks.
Remie Janssen +4 more
doaj +1 more source
Parameterized Complexity of 1-Planarity
We consider the problem of drawing graphs with at most one crossing per edge. These drawings, and the graphs that can be drawn in this way, are called $1$-planar.
Michael Bannister +2 more
doaj +1 more source
On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories [PDF]
This paper introduces a generic framework that provides sufficient conditions for guaranteeing polynomial-time decidability of fixed-negation fragments of first-order theories that adhere to certain fixed-parameter tractability requirements.
Christoph Haase +2 more
doaj +1 more source

