Search Results - Fixed-parameterized algorithm

Fixed parameterized algorithms for generalized feedback vertex set problems by Sheng, Bin, Gutin, Gregory

“… (d-Quasi-Forest Deletion, respectively) in which r=0 (d=0, respectively). We provide an improved FPT algorithm and a smaller kernel for r-Pseudoforest Deletion when parameterized by the solution size (when r is fixed…”
Get full text

Parameterized complexity of categorical clustering with size constraints by Fomin, Fedor V., Golovach, Petr A., Purohit, Nidhi

“…In the Categorical Clustering problem, we are given a set of vectors (matrix) A={a1,…,an} over Σm, where Σ is a finite alphabet, and integers k and B. The task…”
Get full text

Spanning Trees Minimizing Branching Costs by Gargano, Luisa, Rescigno, Adele A.

“…The Minimum Branch Vertices Spanning Tree problem aims to find a spanning tree $T$ in a given graph $G$ with the fewest branch vertices, defined as vertices…”
Get full text

Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique by Paul, Christophe, Perez, Anthony, Thomassé, Stéphan

“…We develop a technique, that we call conflict packing, to obtain (and improve) polynomial kernels for several well-studied editing problems. We first…”
Get full text

A linear kernel for the complementary maximal strip recovery problem by Jiang, Haitao, Zhu, Binhai

“… Combined with the known algorithm using bounded degree search, we obtain the best Fixed-Parameterized-Tractable algorithm for CMSR to this date…”
Get full text

Scheduling meets n-fold integer programming by Knop, Dušan, Koutecký, Martin

“…Scheduling problems are fundamental in combinatorial optimization. Much work has been done on approximation algorithms for NP-hard cases, but relatively little is known about exact solutions when some part of the input is a fixed parameter…”
Get full text

Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem by Baguley, Samuel, Friedrich, Tobias, Neumann, Aneta, Neumann, Frank, Pappik, Marcus, Zeif, Ziena

“…Parameterized analysis provides powerful mechanisms for obtaining fine-grained insights into different types of algorithms…”
Get full text

Polynomial and Fpt Algorithms for Chinese Postman, Packing and Acyclicity by Sheng, Bin

“… In classic complexity theory, we want to decide whether a problem can be solved in polynomial time, likewise, in parameterized complexity research, we aim to provide fixed parameterized algorithms…”
Get full text

Preface of STACS 2020 Special Issue by Paul, Christophe, Bläser, Markus

“…This special issue contains 7 articles which are based on extended abstracts presented at the 36th Symposium on Theoretical Aspects of Computer Science…”
Get full text

Dynamic coloring on restricted graph classes by Bhyravarapu, Sriram, Kumari, Swati, Reddy, I. Vinod

“…A proper k-coloring of a graph is an assignment of colors from the set {1,2,…,k} to the vertices of the graph such that no two adjacent vertices receive the…”
Get full text

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs by Novotná, Jana, Okrasa, Karolina, Pilipczuk, Michał, Rzążewski, Paweł, van Leeuwen, Erik Jan, Walczak, Bartosz

“…; and the considered problem admits a single-exponential fixed-parameter algorithm when parameterized by the treewidth of the input graph…”
Get full text

Parameterized Two‐Qubit Gates for Enhanced Variational Quantum Eigensolver by Rasmussen, Stig Elkjær, Zinner, Nikolaj Thomas

“… A variational quantum eigensolver algorithm is simulated using fixed and parameterized two‐qubit gates in the circuit ansatz and it is shown that the parameterized versions…”
Get full text

Parameterized algorithm for 3-SAT by Gao, Yi

“… We investigated a new method for 3-SAT problem, which is a fixed parameterized algorithm proposed in this paper first…”
Get full text

A Fast Branching Algorithm for Cluster Vertex Deletion by Boral, Anudhyan, Cygan, Marek, Kociumaka, Tomasz, Pilipczuk, Marcin

“… ) -time fixed-parameter algorithm, parameterized by the solution size. In the last 5 years, this algorithm remained the fastest known algorithm for Cluster Vertex…”
Get full text

Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF by Fichte, Johannes K., Ganian, Robert, Hecher, Markus, Slivovsky, Friedrich, Ordyniak, Sebastian

“… algorithm parameterized by the vertex cover number (primal graph).However, prior works have left a gap in our understanding of the complexity…”
Get full text

Characterising parameterized graph classes: certifying algorithms for fixed-parameter tractable problems by Wilson, Samuel Stuart

Get full text

New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem by Chang, Maw-Shang, Lin, Chuang-Chieh, Rossmanith, Peter

“… The best fixed-parameter algorithm devised so far for the parameterized MQI problem runs in time O (4 k n + n 4…”
Get full text

Incremental optimization of independent sets under the reconfiguration framework by Ito, Takehiro, Mizuta, Haruka, Nishimura, Naomi, Suzuki, Akira

“… On the other hand, we give a linear-time algorithm to solve the problem for chordal graphs. We also study the parameterized complexity of the problem with respect to the following three parameters…”
Get full text

Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem: Parameterized and Exact Computation, Part II by KRATSCH, Stefan, NEUMANN, Frank

Get full text

Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times by Shabtay, Dvir, Mor, Baruch

“…We study two scheduling problems in a proportionate flow shop environment, where job processing times are machine independent. In contrast to classical…”
Get full text