Results 21 to 30 of about 1,864,097 (296)
Parameterized Complexity of Gerrymandering
In a representative democracy, the electoral process involves partitioning geographical space into districts which each elect a single representative. These representatives craft and vote on legislation, incentivizing political parties to win as many districts as possible (ideally a plurality). Gerrymandering is the process by which district boundaries
Andrew Fraser +2 more
openaire +2 more sources
Parameterized complexity of reconfiguration of atoms
Abstract Our work is motivated by the challenges presented in preparing arrays of atoms for use in quantum simulation. The recently-developed process of loading atoms into traps results in approximately half of the traps being filled. To consolidate the atoms so that they form a dense and regular arrangement, such as all locations in a grid ...
Alexandre Cooper +3 more
openaire +4 more sources
Parameterized Complexity Classification for Interval Constraints [PDF]
Constraint satisfaction problems form a nicely behaved class of problems that lends itself to complexity classification results. From the point of view of parameterized complexity, a natural task is to classify the parameterized complexity of MinCSP ...
Ordyniak, Sebastian +17 more
core +1 more source
Parameterized learning complexity [PDF]
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using parameterized problem reducibilities, we show that P -sized DNF (CNF) formulas can be exactly learned in time polynomial in the number of variables by extended equivalence queries ...
Rodney G. Downey +2 more
openaire +2 more sources
Consistency Checking Problems: A Gateway to Parameterized Sample Complexity [PDF]
Recently, Brand, Ganian and Simonov introduced a parameterized refinement of the classical PAC-learning sample complexity framework. A crucial outcome of their investigation is that for a very wide range of learning problems, there is a direct and ...
Ganian, Robert +2 more
core +1 more source
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. [PDF]
In this paper, we study the Eulerian Strong Component Arc Deletion problem, where the input is a directed multigraph and the goal is to delete the minimum number of arcs to ensure every strongly connected component of the resulting digraph is Eulerian.
Blažej V +3 more
europepmc +2 more sources
Model-Checking Problems as a Basis for Parameterized Intractability [PDF]
Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted satisfiability problem). For example, Downey and Fellow's W-hierarchy is of this form.
Joerg Flum, Martin Grohe
doaj +1 more source
On the Parameterized Complexity of Compact Set Packing. [PDF]
AbstractThe Set Packing problem is, given a collection of sets $$\mathcal {S}$$ S over a ground set U, to find a maximum collection of sets that are pairwise disjoint. The problem is among the most fundamental NP-hard optimization problems that have been studied extensively in various computational regimes.
Gadekar A.
europepmc +7 more sources
09511 Open Problems – Parameterized complexity and approximation algorithms [PDF]
The paper contains a list of the problems presented on Monday, December 14, 2009 at the open problem session of the Seminar on Parameterized Complexity and Approximation Algorithms, held at Schloss Dagstuhl in Wadern ...
Marx, Dániel +2 more
core +1 more source
New Algorithms for Mixed Dominating Set [PDF]
A mixed dominating set is a collection of vertices and edges that dominates all vertices and edges of a graph. We study the complexity of exact and parameterized algorithms for \textsc{Mixed Dominating Set}, resolving some open questions.
Louis Dublois +2 more
doaj +1 more source

