Výsledky vyhľadávania - Fixed-parameter algorithms and complexity*

Monotone Arithmetic Complexity of Graph Homomorphism Polynomials Autor Komarath, Balagopal, Pandey, Anurag, Rahul, C. S.

“… These polynomials have received a lot of attention recently for their crucial role in several new algorithms for counting and detecting graph patterns, and also for obtaining natural polynomial…”
Získať plný text

Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases Autor Weller, Mathias, Chateau, Annie, Dallard, Clément, Giroudeau, Rodolphe

“…This paper is devoted to new results about the scaffolding problem, an integral problem of genome inference in bioinformatics. The problem consists in finding…”
Získať plný text

Reconciling multiple genes trees via segmental duplications and losses Autor Dondi, Riccardo, Lafond, Manuel, Scornavacca, Celine

“…, even when λ = 0 and a single gene tree is given, solving a long standing open problem on the complexity of multi-gene reconciliation…”
Získať plný text

Fixed-Parameter Complexity of Minimum Profile Problems: Parameterized and Exact Algorithms Autor GUTIN, Gregory, SZEIDER, Stefan, YEO, Anders

Získať plný text

Scheduling and fixed-parameter tractability Autor Mnich, Matthias, Wiese, Andreas

“… However, even though fixed-parameter algorithms are appealing for many reasons, no such algorithms are known for many fundamental scheduling problems…”
Získať plný text

Parameterized complexity of machine scheduling: 15 open problems Autor Mnich, Matthias, van Bevern, René

“… A novel approach to machine scheduling problems are fixed-parameter algorithms. To stimulate this thriving research direction, we propose 15 open questions…”
Získať plný text

On the Complexity of Some Geometric Problems With Fixed Parameters Autor Schaefer, Marcus

“…The following graph-drawing problems are known to be complete for the existential theory of the reals (${\exists \mathbb{R}}$-complete) as long as the…”
Získať plný text

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion Autor Blažej, Václav, Jana, Satyabrata, Ramanujan, M. S., Strulo, Peter

“… The complexity of the problem, when parameterized by solution size (i.e., size of the deletion set…”
Získať plný text

Inferring duplications, losses, transfers and incomplete lineage sorting with nonbinary species trees Autor Stolzer, Maureen, Lai, Han, Xu, Minli, Sathaye, Deepa, Vernot, Benjamin, Durand, Dannie

“…, a process called reconciliation, yet current reconciliation algorithms model only a subset of these evolutionary processes. Results…”
Získať plný text

Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable Autor Szeider, Stefan

“… (Parameterized Complexity, 1999). Our algorithm gives rise to a fixed-parameter tractable parameterization of the satisfiability problem…”
Získať plný text

Parameterized complexity of coverage in multi-interface IoT networks: Pathwidth Autor Aloisio, Alessandro, Navarra, Alfredo

“…The Internet of Things (IoT) has emerged as one of the growing fields in digital technology over the past decade. A primary goal of IoT is to connect physical…”
Získať plný text

Stable Matchings with Covering Constraints: A Complete Computational Trichotomy Autor Mnich, Matthias, Schlotter, Ildikó

“…; most such problems are NP -hard and also hard to approximate (Hamada et al. in Algorithmica 74(1):440–465, 2016). We therefore consider stable matching problems with lower quotas under a relaxed notion of tractability, namely fixed-parameter tractability…”
Získať plný text

The constrained shortest common supersequence problem Autor Dondi, Riccardo

“… Finally, we investigate the parameterized complexity of the problem, and we present a fixed-parameter algorithm…”
Získať plný text

Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane Autor Cambazard, Hadrien, Catusse, Nicolas

“…•A fixed-parameter algorithm for the rectilinear travelling salesman problem.•A fixed-parameter algorithm for the rectilinear Steiner tree problem…”
Získať plný text

Finding approximate and constrained motifs in graphs Autor Dondi, Riccardo, Fertin, Guillaume, Vialette, Stéphane

“…One of the most relevant topics in the analysis of biological networks is the identification of functional motifs inside a network. A recent approach…”
Získať plný text

Randomized Fixed-Parameter Algorithms for the Closest String Problem Autor Chen, Zhi-Zhong, Ma, Bin, Wang, Lusheng

“… s i . The problem is NP-hard and has been extensively studied in the context of approximation algorithms and fixed-parameter algorithms…”
Získať plný text

Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics Autor Marchand, Bertrand, Ponty, Yann, Bulteau, Laurent

“…Hard graph problems are ubiquitous in Bioinformatics, inspiring the design of specialized Fixed-Parameter Tractable algorithms, many of which rely on a combination of tree-decomposition and dynamic programming…”
Získať plný text

Recognizing Map Graphs of Bounded Treewidth Autor Angelini, Patrizio, Bekos, Michael A., Da Lozzo, Giordano, Gronemann, Martin, Montecchiani, Fabrizio, Tappini, Alessandra

“… We present a fixed-parameter tractable algorithm for recognizing map graphs parameterized by treewidth…”
Získať plný text

Parameterized complexity analysis for the Closest String with Wildcards problem Autor Hermelin, Danny, Rozenberg, Liat

“… Our study determines for each natural parameterization whether this parameterization yields a fixed-parameter algorithm, or whether such an algorithm is highly unlikely to exist…”
Získať plný text

Energy Distribution Optimization in Heterogeneous Networks with Min–Max and Local Constraints as Support of Ambient Intelligence Autor Aloisio, Alessandro, Bloisi, Domenico D., Romano, Marco, Vinci, Cosimo

“…In recent years, ambient intelligence (AmI) has gained significant attention from both academia and industry. AmI seeks to create environments that…”
Získať plný text