Set packing np complete computational (2 résultats)
- Autres images
- Couverture souple
- impression à la demande
Vendeur : AHA-BUCH GmbH, Einbeck, AllemagneAHA-BUCH GmbH
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 35,89
EUR 60,75 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! 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 subs…ets 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 intersect). The problem is clearly in NP since, given k subsets, we can easily verify that they are pairwise disjoint. 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, belongs to the class of packing problems, and its dual linear program is the set cover problem.
- Autres images
- Couverture souple
- impression à la demande
Vendeur : preigu, Osnabrück, Allemagnepreigu
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 109,85
EUR 70,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 5 disponible(s)
Taschenbuch. Etat : Neu. Set Packing | NP-Complete, Computational Complexity Theory, Combinatorics | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131161872 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter:…preigu Print on Demand.
