Search Results - parameterized computational complexity

Parameterized computational complexity of finding small-diameter subgraphs by Schäfer, Alexander, Komusiewicz, Christian, Moser, Hannes, Niedermeier, Rolf

“…Finding subgraphs of small diameter in undirected graphs has been seemingly unexplored from a parameterized complexity perspective…”
Get full text

Parameterized computational complexity of control problems in voting systems by Liu, Hong, Feng, Haodi, Zhu, Daming, Luan, Junfeng

“…Voting systems are common tools in a variety of areas. This paper studies parameterized computational complexity of control of Plurality, Condorcet and Approval voting systems, respectively…”
Get full text

Parameterized computational complexity of Dodgson and Young elections by Betzler, Nadja, Guo, Jiong, Niedermeier, Rolf

“…We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner…”
Get full text

Computational benefit of smoothness: Parameterized bit-complexity of numerical operators on analytic functions and Gevrey’s hierarchy by Kawamura, Akitoshi, Müller, Norbert, Rösnick, Carsten, Ziegler, Martin

“…The synthesis of (discrete) Complexity Theory with Recursive Analysis provides a quantitative algorithmic foundation to calculations over real numbers, sequences, and functions by approximation up to prescribable absolute error 1/2n…”
Get full text

Strong computational lower bounds via parameterized complexity by Chen, Jianer, Huang, Xiuzhen, Kanj, Iyad A., Xia, Ge

“… collapse occurs in parameterized complexity theory, the problem is not solvable in time f ( k ) n o ( k…”
Get full text

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

“…Understanding the computational complexity of training simple neural networks with rectified linear units (ReLUs…”
Get full text

A multivariate complexity analysis of the material consumption scheduling problem by Bentert, Matthias, Bredereck, Robert, Györgyi, Péter, Kaczmarczyk, Andrzej, Niedermeier, Rolf

“… We initiate a systematic exploration of the parameterized computational complexity landscape of Material Consumption Scheduling , providing parameterized tractability as well as intractability results…”
Get full text

On coalitional manipulation for multiwinner elections: shortlisting by Bredereck, Robert, Kaczmarczyk, Andrzej, Niedermeier, Rolf

“… We provide the first in-depth study of the computational complexity of strategic voting for shortlisting based on the perhaps most basic voting rule in this scenario, ℓ -Bloc…”
Get full text

Assessing the computational complexity of multilayer subgraph detection by Bredereck, Robert, Komusiewicz, Christian, Kratsch, Stefan, Molter, Hendrik, Niedermeier, Rolf, Sorge, Manuel

“… (edges in different layers). We chart the border of computational (in)tractability for the class of subgraph detection problems on multilayer graphs, including…”
Get full text

A generalization of Nemhauser and Trotterʼs local optimization theorem by Fellows, Michael R., Guo, Jiong, Moser, Hannes, Niedermeier, Rolf

“…The Nemhauser–Trotter local optimization theorem applies to the NP-hard Vertex Cover problem and has applications in approximation as well as parameterized algorithmics…”
Get full text

On tractable cases of Target Set Selection by Nichterlein, André, Niedermeier, Rolf, Uhlmann, Johannes, Weller, Mathias

“…We study the NP-hard Target Set Selection (TSS) problem occurring in social network analysis. Roughly speaking, given a graph where each vertex is associated…”
Get full text

Exploring Algorithmic Options for the Efficient Design and Reconfiguration of Reactive Robot Swarms by Wareham, Todd

“…A key challenge in robot swarm engineering is the design of individual robot controllers such that the robots as a group can perform a specified task. In this…”
Get full text

ON PARAMETERIZED COMPLEXITY OF HITTING SET PROBLEM FOR AXIS–PARALLEL SQUARES INTERSECTING A STRAIGHT LINE by Daniel M. Khachay, Michael Yu. Khachay

“…The Hitting Set Problem (HSP) is the well known extremal problem adopting research interest in the fields of combinatorial optimization, computational geometry, and statistical learning theory for decades…”
Get full text

Parameterized complexity analysis in computational biology by Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hallett, M.T., Wareham, H.T.

“… We argue that for many problems in this setting, parameterized computational complexity rather than NP-completeness is the appropriate tool for studying apparent intractability…”
Get full text

Computational Social Choice: Parameterized Complexity and Challenges by Chena, Jiehua, Hatschka, Christian, Simola, Sofia

“…We survey two key problems-Multi-Winner Determination and Hedonic Games in Computational Social Choice, with a special focus on their parameterized complexity…”
Get full text

Prices matter for the parameterized complexity of shift bribery by Bredereck, Robert, Chen, Jiehua, Faliszewski, Piotr, Nichterlein, André, Niedermeier, Rolf

“… We study the parameterized computational complexity of Shift Bribery for a number of parameters and several classes of price functions…”
Get full text

Parameterized Dynamic Cluster Editing by Luo, Junjie, Molter, Hendrik, Nichterlein, André, Niedermeier, Rolf

“…We introduce a dynamic version of the NP-hard graph modification problem Cluster Editing . The essential point here is to take into account dynamically…”
Get full text

Gerrymandering on graphs: Computational complexity and parameterized algorithms by Gupta, Sushmita, Jain, Pallavi, Panolan, Fahad, Roy, Sanjukta, Saket Saurabh

“…] about the computational complexity of the problem when the input graph is a path. Next, we propose a generalization of their model, where the input consists of a graph on \(n…”
Get full text

Homology localization through the looking-glass of parameterized complexity theory by Blaser, Nello, Vågset, Erlend Raa

“… It is an NP-complete problem, which this paper addresses using parameterized complexity theory…”
Get full text

The parameterized complexity of finding minimum bounded chains by Blaser, Nello, Brun, Morten, Salbu, Lars M., Vågset, Erlend Raa

“…) algorithms solving MBCd for all d. The first algorithm uses a shortest path approach and is parameterized by solution size and coface degree…”
Get full text