Results 41 to 50 of about 2,616,817 (282)
The “Art of Trellis Decoding” Is Fixed-Parameter Tractable [PDF]
IEEE Transactions on Information Theory, 2017 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.
Jisu Jeong +2 more
openaire +3 more sources
Parameterized Algorithms for (r,l)-Partization
Journal of Graph Algorithms and Applications, 2013 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
On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories [PDF]
Logical Methods in Computer ScienceThis 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
Bounded fixed-parameter tractability and log2n nondeterministic bits [PDF]
, 2006 Motivated by recent results showing that there are natural parameterized problems that are fixed-parameter tractable, but can only be solved by fixed-parameter tractable algorithms the running time of which depends nonelementarily on the parameter, we ...
Flum, Jörg, Weyer, Mark, Grohe, Martin
core +1 more source
On the Fixed-Parameter Tractability of Capacitated Clustering
CoRR, 2019 We study the complexity of the classic capacitated k-median and k-means problems parameterized by the number of centers, k. These problems are notoriously difficult since the best known approximation bound for high dimensional Euclidean space and general metric space is $Θ(\log k)$ and it remains a major open problem whether a constant factor exists ...
Cohen-Addad, Vincent, Li, Jason
openaire +7 more sources
Parameterized Complexity of 1-Planarity
Journal of Graph Algorithms and Applications, 2018 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
Scheduling Meets Fixed-Parameter Tractability
CoRR, 2013 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]
Algorithmica, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arvind, V. +3 more
openaire +5 more sources
The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability
Journal of Graph Algorithms and ApplicationsA $k$-edge-coloring of a graph is an assignment of colors $\{1,...,k\}$ to edges of the graph such that adjacent edges receive different colors. In the maximum $k$-edge-colorable subgraph problem we are given a graph and an integer $k$, the goal is to ...
Vahan Mkrtchyan
doaj +1 more source
Treewidth of display graphs: bounds, brambles and applications
Journal of Graph Algorithms and Applications, 2019 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