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...

Commons has media related to Set cover problem. Benchmarks with Hidden Optimum Solutions for Set Covering, Set Packing 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...

independent sets, only one need be output. This problem is sometimes referred to as "vertex packing". In the maximum-weight independent set problem, the...

most 3 sets, i.e., when we want a perfect matching in a 3-regular hypergraph. In this case, a 3-dimensional matching is not only a set packing, but also...

for disjoint convex sets Mutually exclusive events Relatively prime, numbers with disjoint sets of prime divisors Separoid Set packing, the problem of finding...

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...

relaxations of the set packing problem, the independent set problem, and the matching problem are packing LPs. The LP relaxations of the set cover problem...

In geometry, a sphere packing is an arrangement of non-overlapping spheres within a containing space. The spheres considered are usually all of identical...

discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices. In other words, a subset...

by an N C 1 {\displaystyle NC^{1}} reduction from either the maximum set packing or the maximal matching problem or by an N C 2 {\displaystyle NC^{2}}...

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...

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 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...

computer science, as part of integer programming approaches to problems of set packing and linear ordering. Certain configurations within these problems can...

optimal allocation. The combinatorial auction problem can be modeled as a set packing problem. Therefore, many algorithms have been proposed to find approximated...

are called packing problems. The most prominent examples of covering problems are the set cover problem, which is equivalent to the hitting set problem,...

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...

optimization) Clique (see also independent set problem) Set packing Vertex cover Set covering Feedback node set Feedback arc set Directed Hamilton circuit (Karp's...

the incidence matrix, to the hitting set problem.: SP5, SP8  Set packing: SP3  Set splitting problem: SP4  Scheduling to minimize weighted completion...

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...

oscillating merge sort out-branching out-degree overlapping subproblems packing (see set packing) padding argument pagoda pairing heap PAM (point access method)...

The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane whose...

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...

theory of metric spaces, ε-nets, ε-packings, ε-coverings, uniformly discrete sets, relatively dense sets, and Delone sets (named after Boris Delone) are several...

Judicial Procedures Reform Bill of 1937, frequently called the "court-packing plan", was a legislative initiative proposed by U.S. President Franklin...

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...

mathematics, an Apollonian gasket, Apollonian net, or Apollonian circle packing is a fractal generated by starting with a triple of circles, each tangent...

intersect) is a perfect graph. The problem of set packing is equivalent to hypergraph matching. A vertex-packing in a (simple) graph is a subset P of its vertices...