Set splitting problem

Known as: Max Set Splitting, Max set splitting problem, Set Splitting 
In computational complexity theory, the Set Splitting problem is the following decision problem: given a family F of subsets of a finite set S… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We describe here an optical device, based on time-delays, for solving the set splitting problem which is well-known NP-complete… (More)
  • figure 1
  • figure 2
Is this relevant?
2013
2013
In this paper, an electromagnetism-like approach (EM) for solving the maximum set splitting problem (MSSP) is applied. Hybrid… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2013
2013
Many systems of equations fit naturally in the form du/dt = A(u) + B(u). We may separate convection from diffusion, x-derivatives… (More)
  • figure 2.1
  • figure 5.1
  • figure 6.1
  • figure 8.1
  • figure 8.2
Is this relevant?
2012
2012
We consider the maximum set splitting problem (MSSP). For the first time an integer linear programming (ILP) formulation is… (More)
  • table 1
  • table 2
Is this relevant?
2010
2010
Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on… (More)
  • table 1
Is this relevant?
2005
2005
We study the problem kSET SPLITTING in fixed parameter complexity. We show that the problem can be solved in time O∗(2.6494k… (More)
Is this relevant?
2004
2004
Adleman wrote the first paper that demonstrated that DNA ( DeoxyriboNucleic Acid ) strands could be applied for dealing with… (More)
  • table 2
  • table 5
  • table 8
Is this relevant?
2004
2004
The two objectives of this paper are: (1) to articulate three new general techniques for designing FPT algorithms, and (2) to… (More)
  • figure 1
  • figure 2
Is this relevant?
2003
2003
An FPT algorithm with a running time of O(n +2n) is described for the Set Splitting problem, parameterized by the number k of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1999
1999
There are many algorithms for the space-time mapping of nested loops. Some of them even make the optimal choices within their… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?