Search Results - "parameterized complexity"

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

“… out (subject to the usual…”
Get full text

Single-machine scheduling with fixed energy recharging times to minimize the number of late jobs and the number of just-in-time jobs: A parameterized complexity analysis by Yu, Renjie, Oron, Daniel

“… Subject to a predefined energy capacity, energy can be recharged after each job during a fixed recharging period…”
Get full text

Parameterized Complexity of Secluded Connectivity Problems by Fomin, Fedor V., Golovach, Petr A., Karpov, Nikolay, Kulikov, Alexander S.

“… In this paper we present a systematic study of the parameterized complexity of Secluded Steiner Tree…”
Get full text

On the Parameterized Complexity of the Expected Coverage Problem by Fomin, Fedor V., Ramamoorthi, Vijayaragunathan

“… We study the variant of MCLP where edges of the network are subject to random failures due to some disruptive events…”
Get full text

Parameterized Complexity Results for Exact Bayesian Network Structure Learning by Ordyniak, S., Szeider, S.

“…Bayesian network structure learning is the notoriously difficult problem of discovering a Bayesian network that optimally represents a given set of training…”
Get full text

Kernelization using structural parameters on sparse graph classes by Gajarský, Jakub, Hliněný, Petr, Obdržálek, Jan, Ordyniak, Sebastian, Reidl, Felix, Rossmanith, Peter, Sánchez Villaamil, Fernando, Sikdar, Somnath

“… •Meta-theorems for linear kernels have been the subject of intensive…”
Get full text

Parameterized analysis and crossing minimization problems by Zehavi, Meirav

“…In this survey/introductory article, we first present the basics of the field of Parameterized Complexity, made accessible to readers without background on the subject…”
Get full text

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

“… out (subject to the usual…”
Get full text

A multiparametric view on answer set programming by Fichte, Johannes K., Kronegger, Martin, Woltran, Stefan

“… During the last decades different approaches have been applied to find tractable fragments of programs, in particular, also using parameterized complexity…”
Get full text

Complexity of Secure Sets by 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…”
Get full text

The role of planarity in connectivity problems parameterized by treewidth by Baste, Julien, Sau, Ignasi

“…For some years it was believed that for “connectivity” problems such as Hamiltonian Cycle, algorithms running in time 2O(tw)⋅nO(1) – called single-exponential…”
Get full text

On finding optimal polytrees by Gaspers, Serge, Koivisto, Mikko, Liedloff, Mathieu, Ordyniak, Sebastian, Szeider, Stefan

“…We study the NP-hard problem of finding a directed acyclic graph (DAG) on a given set of nodes so as to maximize a given scoring function. The problem models…”
Get full text

Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem by Gutin, Gregory, Kratsch, Stefan, Wahlström, Magnus

“…The workflow satisfiability problem ( wsp ) is a problem of practical interest that arises whenever tasks need to be performed by authorized users, subject to constraints defined by business rules…”
Get full text

High-multiplicity scheduling on one machine with forbidden start and completion times by Gabay, Michaël, Rapine, Christophe, Brauner, Nadia

“… This problem models the situation where an additional resource, subject to unavailability constraints, is required to start and to finish a job…”
Get full text

Parameterized Complexity Results for Exact Bayesian Network Structure Learning by Ordyniak, Sebastian, Szeider, Stefan

“…Bayesian network structure learning is the notoriously difficult problem of discovering a Bayesian network that optimally represents a given set of training…”
Get full text

Tractable cases of the extended global cardinality constraint by Samer, Marko, Szeider, Stefan

“…We study the consistency and domain consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set  X of variables,…”
Get full text

Combinatorics in AI: Principles & Algorithms An Extended Abstract by Barr, Joseph R., Haass, Jon C, Shaw, Peter, Abu-Khzam, Faisal N.

“…Therein we describe a few cases where combinatorics appears in machine learning. The fundamental problem of learning is intimately connected to combinatorial…”
Get full text

Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines by Hanen, Claire, Munier Kordon, Alix

“… However, few parameterized complexity results exist for these problems. This paper studies the existence of a feasible schedule for a typed task system with precedence constraints and time intervals ( r i , d i ) for each job…”
Get full text

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

“… Both of this perspectives have been neglected in the previous literature. We begin by presenting a parameterized complexity analysis of the N P -hard problem of minimizing the total late work on a single machine…”
Get full text

The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality by Froese, Vincent, Hertrich, Christoph, Niedermeier, Rolf

“…) has recently been a subject of intensive research. Closing gaps and complementing results from the literature, we present several results on the parameterized complexity of training two-layer ReLU networks with respect to various loss functions…”
Get full text