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 one has a finite set S and a list of subsets of S. Then, the set packing problem asks if some k subsets in the list are pairwise disjoint (in other words, no two of them share an element).
More formally, given a universe and a family of subsets of , a packing is a subfamily of sets such that all sets in are pairwise disjoint. The size of the packing is . In the set packing decision problem, the input is a pair and an integer ; the question is whether
there is a set packing of size or more. In the set packing optimization problem, the input is a pair , and the task is to find a set packing that uses the most sets.
The problem is clearly in NP since, given subsets, we can easily verify that they are pairwise disjoint in polynomial time.
The optimization version of the problem, maximum set packing, asks for the maximum number of pairwise disjoint sets in the list. It is a maximization problem that can be formulated naturally as an integer linear program, belonging to the class of packing problems.
Setpacking is a classical NP-complete problem in computational complexity theory and combinatorics, and was one of Karp's 21 NP-complete problems. Suppose...
Commons has media related to Set cover problem. Benchmarks with Hidden Optimum Solutions for Set Covering, SetPacking and Winner Determination A compendium...
Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to...
The bin packing problem is an optimization problem, in which items of different sizes must be packed into a finite number of bins or containers, each...
Rectangle packing is a packing problem where the objective is to determine whether a given set of small rectangles can be placed inside a given large polygon...
for disjoint convex sets Mutually exclusive events Relatively prime, numbers with disjoint sets of prime divisors Separoid Setpacking, the problem of finding...
relaxations of the setpacking problem, the independent set problem, and the matching problem are packing LPs. The LP relaxations of the set cover problem...
A packing density or packing fraction of a packing in some space is the fraction of the space filled by the figures making up the packing. In simplest...
an edge cover of a graph is a set of edges such that every vertex of the graph is incident to at least one edge of the set. In computer science, the minimum...
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...
In geometry, a sphere packing is an arrangement of non-overlapping spheres within a containing space. The spheres considered are usually all of identical...
are called packing problems. The most prominent examples of covering problems are the set cover problem, which is equivalent to the hitting set problem,...
Sphere packing in a sphere is a three-dimensional packing problem with the objective of packing a given number of equal spheres inside a unit sphere. It...
by an N C 1 {\displaystyle NC^{1}} reduction from either the maximum setpacking or the maximal matching problem or by an N C 2 {\displaystyle NC^{2}}...
In mathematics, a packing in a hypergraph is a partition of the set of the hypergraph's edges into a number of disjoint subsets such that no pair of edges...
Circle packing in a circle is a two-dimensional packing problem with the objective of packing unit circles into the smallest possible larger circle. If...
curvatures appearing in a primitive integral Apollonian circle packing must belong to a set of six or eight possible residues classes modulo 24, and numerical...
optimal allocation. The combinatorial auction problem can be modeled as a setpacking problem. Therefore, many algorithms have been proposed to find approximated...
intersect) is a perfect graph. The problem of setpacking is equivalent to hypergraph matching. A vertex-packing in a (simple) graph is a subset P of its vertices...
Judicial Procedures Reform Bill of 1937, frequently called the "court-packing plan", was a legislative initiative proposed by U.S. President Franklin...
cube? (more unsolved problems in mathematics) In combinatorics, tripod packing is a problem of finding many disjoint tripods in a three-dimensional grid...
the Julia set and the Fatou set are two complementary sets (Julia "laces" and Fatou "dusts") defined from a function. Informally, the Fatou set of the function...
The strip packing problem is a 2-dimensional geometric minimization problem. Given a set of axis-aligned rectangles and a strip of bounded width and infinite...
The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane whose...
Global Information
