Výsledky vyhledávání - Fixed-parameterized algorithm*

Fixed parameterized algorithms for generalized feedback vertex set problems Autor 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…”
Získat plný text

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

“…}. We extend this algorithmic result to a popular capacitated clustering model, where in addition the sizes of the clusters are lower and upper bounded by integer parameters p and q, respectively…”
Získat plný text

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

“… Extensive research has been conducted on the algorithmic and combinatorial aspects of this problem, with recent studies delving into its fixed-parameter tractability…”
Získat plný text

Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique Autor 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…”
Získat plný text

A linear kernel for the complementary maximal strip recovery problem Autor 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…”
Získat plný text

Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem Autor 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…”
Získat plný text

Polynomial and Fpt Algorithms for Chinese Postman, Packing and Acyclicity Autor 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…”
Získat plný text

Dynamic coloring on restricted graph classes Autor 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…”
Získat plný text

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs Autor 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…”
Získat plný text

Parameterized Two‐Qubit Gates for Enhanced Variational Quantum Eigensolver Autor 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…”
Získat plný text

A Fast Branching Algorithm for Cluster Vertex Deletion Autor 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…”
Získat plný text

Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF Autor 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…”
Získat plný text

Preface of STACS 2020 Special Issue Autor 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…”
Získat plný text

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

Získat plný text

Parameterized algorithm for 3-SAT Autor Gao, Yi

“… We investigated a new method for 3-SAT problem, which is a fixed parameterized algorithm proposed in this paper first…”
Získat plný text

New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem Autor 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…”
Získat plný text

Incremental optimization of independent sets under the reconfiguration framework Autor 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…”
Získat plný text

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

Získat plný text

Hitting and Harvesting Pumpkins Autor Joret, Gwenaël, Paul, Christophe, Sau, Ignasi, Saurabh, Saket, Thomassé, Stéphan

“…$-pumpkin-models in a given graph in the realm of approximation algorithms and parameterized algorithms…”
Získat plný text

Preprocessing to reduce the search space: Antler structures for feedback vertex set Autor Donkers, Huib, Jansen, Bart M.P.

“… We develop the graph structure theory around such decompositions and develop fixed-parameter tractable algorithms to find them, parameterized by the number of vertices for which they witness presence…”
Získat plný text