Le problème de set packing est un problème d'optimisation combinatoire NP-complet. Il peut être considéré comme une version particulière du problème du sac à dos multidimensionnel où les poids des objets sont égaux à 0 ou 1 et où les capacités du sac sont toutes égales à 1.
Wikimedia Foundation. 2010.
Contenu soumis à la licence CC-BY-SA. Source : Article Set packing de Wikipédia en français (auteurs)
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 we have a finite set S and a list of subsets of S. Then, the set packing problem asks if some k… … Wikipedia
Packing — may refer to:In Mechanical engineering: * Packing, also known as an O ring or other type of Seal (mechanical), a term for a sealing material * Packing gland is a mechanical term for the groove in which a packing sits.In Mathematics: * Sphere… … Wikipedia
Packing problem — Part of a series on Puzzles … Wikipedia
Set cover problem — The set covering problem is a classical question in computer science and complexity theory. As input you are given several sets. They may have some elements in common. You must select a minimum number of these sets so that the sets you have… … Wikipedia
set honey — закристаллизовавшийся мед honey packing plant установка для расфасовки меда honey flavor imitation имитация аромата меда crystallized honey закристаллизовавшийся мед granulated honey закристаллизовавшийся мед solid honey закристаллизовавшийся мед … English-Russian travelling dictionary
Independent set (graph theory) — The nine blue vertices form a maximum independent set for the Generalized Petersen graph GP(12,4). In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent. That is, it is a set I of vertices … Wikipedia
Circle packing theorem — Example of the circle packing theorem on K5, the complete graph on five vertices, minus one edge. The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane … Wikipedia
Kakeya set — deltoid. At every stage of its rotation, the needle is in contact with the deltoid at three points: two endpoints (blue) and one tangent point (black).The needle s midpoint (red) describes a circle with diameter equal to half the length of the… … Wikipedia
Reduced instruction set computer — The acronym RISC (pronounced risk ), for reduced instruction set computing, represents a CPU design strategy emphasizing the insight that simplified instructions which do less may still provide for higher performance if this simplicity can be… … Wikipedia
To set the cart before the horse — Cart Cart (k[aum]rt), n. [AS. cr[ae]t; cf. W. cart, Ir. & Gael. cairt, or Icel. kartr. Cf. {Car}.] 1. A common name for various kinds of vehicles, as a Scythian dwelling on wheels, or a chariot. Ph[oe]bus cart. Shak. [1913 Webster] 2. A two… … The Collaborative International Dictionary of English
