Live briefing
Everything about Set splitting problem
In computational complexity theory, the set splitting problem is the following decision problem: given a family F of subsets of a finite set S, decide whether there exists a partition of S into two subsets S1, S2 such that all elements of F are split by this partition, i.e., none of the elements of F is completely in S1 or S2. Set Splitting is one of Garey & Johnson's classical NP-complete problems. The problem is sometimes called hypergraph 2-colorability. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Set splitting problemA 5-minute orientation
- Pick up a classic book: Recent Developments in Representation TheoryThe most-reprinted book on the subject
- Read the landmark paper: Towards solution of the set-splitting problem on gel-based DNA computingCited 24 times
- Go sideways: Maximum cutA closely related topic
- Go sideways: APXA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Towards solution of the set-splitting problem on gel-based DNA computing
Capacitated lot-sizing problem with production carry-over and set-up splitting: mathematical models
A note on modelling the capacitated lot-sizing problem with set-up carryover and set-up splitting
An electromagnetism-like method for the maximum set splitting problem
The splitting problem for pure extensions of Abelian groups and axiomatic set theory
An optical solution for the set splitting problem
Algorithmic Research on the Multi-Set Splitting Feasibility Problem
A New Algorithm for Set Splitting Problem Based DNA Molecules Computation
📚 Books worth reading
- 📕Recent Developments in Representation TheoryAlex Martsinkovsky, Gordana Todorov · 2016
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Maximum cut In a graph, a maximum cut is a cut whose size is at least the size of any other cut. That is, it is a partition of the graph's vertices into two complementary…
- APX In computational complexity theory, the class APX (an abbreviation of "approximable") is the set of NP optimization problems that allow polynomial-time…
- Cut (graph theory) In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. Any cut determines a cut-set, the set of edges that have one…
- Minimum k-cut In mathematics, the minimum k-cut is a combinatorial optimization problem that requires finding a set of edges whose removal would partition the graph…
- Vertex cover In graph theory, a vertex cover (sometimes node cover) of a graph is a set of vertices that includes at least one endpoint of every edge of the graph.…
- Dominating set In graph theory, a dominating set for a graph G is a subset D of its vertices, such that any vertex of G is in D, or has a neighbor in D. The domination…
- Set packing Set packing is a classical NP-complete problem in computational complexity theory and combinatorics, and was one of Karp's 21 NP-complete problems. Suppose…
- NP-hardness In computational complexity theory, a computational problem H is called NP-hard if, for every problem L which can be solved in non-deterministic polynomial-time…