Results 311 to 320 of about 2,051,541 (361)

Towards exact structural thresholds for parameterized complexity

International Symposium on Parameterized and Exact Computation, 2021
Parameterized complexity seeks to use input structure to obtain faster algorithms for NP-hard problems. This has been most successful for graphs of low treewidth: Many problems admit fast algorithms relative to treewidth and many of them are optimal ...
Falko Hegerfeld, Stefan Kratsch
semanticscholar   +1 more source

Parameterized Random Complexity

Theory of Computing Systems, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Müller, Moritz, Montoya, Juan Andres
openaire   +1 more source

Parameterized Complexity of Geodetic Set

International Symposium on Parameterized and Exact Computation, 2020
A vertex set $S$ of a graph $G$ is geodetic if every vertex of $G$ lies on a shortest path between two vertices in $S$. Given a graph $G$ and $k \in \mathbb N$, the NP-hard Geodetic Set problem asks whether there is a geodetic set of size at most $k ...
Leon Kellerhals, Tomohiro Koana
semanticscholar   +1 more source

On the (Parameterized) Complexity of Almost Stable Marriage

Foundations of Software Technology and Theoretical Computer Science, 2020
In the Stable Marriage problem. when the preference lists are complete, all agents of the smaller side can be matched. However, this need not be true when preference lists are incomplete.
Sushmita Gupta, P. Jain, Sanjukta Roy, Saket Saurabh, M. Zehavi   +4 more
semanticscholar   +1 more source

On Parameterized Complexity of Binary Networked Public Goods Game

Algorithmica, 2020
In the binary networked public goods (BNPG for short) game, every player needs to decide if she participates in a public project whose utility is shared equally by the community.
Arnab Maiti, P. Dey
semanticscholar   +1 more source

On Parameterized Complexity of Liquid Democracy

International Conference on Algorithms and Discrete Applied Mathematics, 2020
In liquid democracy, each voter either votes herself or delegates her vote to some other voter. This gives rise to what is called a delegation graph. To decide the voters who eventually votes along with the subset of voters whose votes they give, we need
P. Dey, Arnab Maiti, Amatya Sharma
semanticscholar   +1 more source

On the Parameterized Complexity of Grid Contraction

Scandinavian Workshop on Algorithm Theory, 2020
For a family of graphs $\mathcal{G}$, the $\mathcal{G}$-\textsc{Contraction} problem takes as an input a graph $G$ and an integer $k$, and the goal is to decide if there exists $F \subseteq E(G)$ of size at most $k$ such that $G/F$ belongs to $\mathcal{G}
Saket Saurabh, U. Souza, P. Tale
semanticscholar   +1 more source

Parameterized Complexity of Scheduling Chains of Jobs with Delays

International Symposium on Parameterized and Exact Computation, 2020
In this paper, we consider the parameterized complexity of the following scheduling problem. We must schedule a number of jobs on $m$ machines, where each job has unit length, and the graph of precedence constraints consists of a set of chains.
H. Bodlaender, M. V. D. Wegen
semanticscholar   +1 more source

The Parameterized Complexity of the k-Biclique Problem

Journal of the ACM, 2018
Given a graph G and an integer k, the k-Biclique problem asks whether G contains a complete bipartite subgraph with k vertices on each side. Whether there is an f(k) ċ |G|O(1)-time algorithm, solving k-Biclique for some computable function f has been a ...
Bingkai Lin
semanticscholar   +1 more source

Parameterized Complexity of Committee Elections with Dichotomous and Trichotomous Votes

Adaptive Agents and Multi-Agent Systems, 2019
We study the winner determination problem for three prevalent committee election rules: Chamberlin-Courant Approval Voting(CCA), Proportional Approval Voting (PAV), and Satisfaction Approval Voting (SAV).
Aizhong Zhou, Yongjie Yang, Jiong Guo
semanticscholar   +1 more source