Výsledky vyhledávání - "FPT Algorithm"

Selecting intervals to optimize the design of observational studies subject to fine balance constraints Autor Levin, Asaf

“… We show that the resulting optimization problem is NP-hard. However, it admits an FPT algorithm with respect to a natural parameter…”
Získat plný text

Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis Autor Gutin, Gregory, Wahlström, Magnus

“… The Workflow Satisfiability Problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification, subject to certain constraints on the assignment…”
Získat plný text

Complexity of Secure Sets Autor Bliem, Bernhard, Woltran, Stefan

“… In this work, we pinpoint the complexity of this problem by showing that it is Σ 2 P -complete. Furthermore, the problem has so far not been subject to a parameterized complexity analysis that considers structural parameters…”
Získat plný text

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

“… out (subject to the usual…”
Získat plný text

A fixed-parameter tractable approximation for capacitated k-supplier Autor Liu, Shuilian, Chen, Xianrun, Xu, Yicheng

“…•We propose the first randomized FPT algorithm for this problem, achieving a 5-approximation…”
Získat plný text

Faster optimal algorithms for segment minimization with small maximal value Autor Biedl, Therese, Durocher, Stephane, Engelbeen, Céline, Fiorini, Samuel, Young, Maxwell

“…; our algorithm obtains a significant asymptotic speedup over the previous best FPT algorithm. We also show how to solve the full-matrix…”
Získat plný text

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

“… out (subject to the usual…”
Získat plný text

Human Brain Glutamate, Glutamine, γ-Aminobutyric Acid Proton Magnetic Resonance Spectral Quantification with the Fast Padé Transform Autor Zhang, Jingjing Michele

“…Glutamate, glutamine, and gamma-Aminobutyric acid play important excitatory and inhibitory messenger role in neuronal signal transmissions. Perturbations in…”
Získat plný text

Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints Autor Karapetyan, Daniel, Parkes, Andrew J., Gutin, Gregory, Gagarin, Andrei

“…), covering many practical cases, admits FPT algorithms, i.e. can be solved in time exponential only in the number of steps k and polynomial in the number of users n.  Since usually k…”
Získat plný text

A Mechanism for Participatory Budgeting With Funding Constraints and Project Interactions Autor Goyal, Mohak, Sarmasarkar, Sahasrajit, Goel, Ashish

“… Also, the outcomes of PB in practice are subject to various minimum/maximum funding constraints on 'types' of projects…”
Získat plný text

Feedback set problems in tournaments Autor Sasatte, Prashant Vishvanath

“… satisfaction and bayesian inference in artificial intelligence and graph drawing. Therefore, in recent years feedback set problems have been the subject of growing interest…”
Získat plný text

Two dichotomies for model-checking in multi-layer structures Autor Enright, Jessica, Meeks, Kitty, Ryan, Jessica

“… in each layer to guarantee the existence of an FPT algorithm to solve problems definable in either first-order or monadic second-order logic on the overall system, subject to the assumption that the structural properties are preserved under deletion of vertices and/or edges…”
Získat plný text

Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong Exponential Time Hypothesis Autor Gutin, Gregory, Wahlstrom, Magnus

“…[1]-hard, i.e., it is unlikely that there exists a fixed-parameter tractable (FPT) algorithm for solving the WSP. Crampton et al. (2013) and Cohen et al. (2014…”
Získat plný text

Complexity of Secure Sets Autor Bliem, Bernhard, Woltran, Stefan

“… Furthermore, the problem has so far not been subject to a parameterized complexity analysis that considers…”
Získat plný text

A new perspective on single-machine scheduling problems with late work related criteria Autor Shabtay, Dvir

“…This paper provides two new perspectives on single-machine scheduling problems in which the objective involves penalties regarding late work. Both of this…”
Získat plný text

Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints Autor Karapetyan, Daniel, Parkes, Andrew J, Gutin, Gregory, Gagarin, Andrei

“…), covering many practical cases, admits FPT algorithms, i.e. can be solved in time exponential only in the number of steps \(k…”
Získat plný text

Budgeted Matroid Maximization: a Parameterized Viewpoint Autor Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas

“…\)-dimensional matching (i.e., \(B = \infty\)) already for \(\ell = 3\). Nevertheless, while there are known FPT algorithms for the unbudgeted variants of the above problems, the {\em budgeted…”
Získat plný text