Sinossi
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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 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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per Set Packing: NP-Complete, Computational Complexity...
Immagini fornite dal venditore
Set Packing
Print on DemandDa: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 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 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. 88 pp. Englisch. Codice articolo 9786131161872
Compra nuovo
EUR 34,00
Spedizione EUR 23,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Set Packing : NP-Complete, Computational Complexity Theory, Combinatorics
Print on DemandDa: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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 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 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. Codice articolo 9786131161872
Compra nuovo
EUR 35,89
Spedizione EUR 60,75
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Set Packing | NP-Complete, Computational Complexity Theory, Combinatorics
Print on DemandDa: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 113278937
Compra nuovo
EUR 109,85
Spedizione EUR 70,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 5 disponibili
Immagini fornite dal venditore
Set Packing
Print on DemandDa: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. Set packing is aclassical NP-complete problem in computational complexity theory andcombinatorics, and was one of Karp's 21 NP-complete problems. Suppose wehave a finite set S and a list of subsets of S. Then, the set packingproblem asks if some k subsets in the list are pairwise disjoint (inother words, no two of them intersect). The problem is clearly in NPsince, given k subsets, we can easily verify that they are pairwisedisjoint. The optimization version of the problem, maximum set packingasks for the maximum number of pairwise disjoint sets in the list. It isa maximization problem that can be formulated naturally as an integerlinear program, belongs to the class of packing problems, and its duallinear program is the set cover problem.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 88 pp. Englisch. Codice articolo 9786131161872
Compra nuovo
EUR 136,00
Spedizione EUR 60,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili