Set Packing: NP-Complete, Computational Complexity Theory, Combinatorics - Softcover

 
9786131161872: Set Packing: NP-Complete, Computational Complexity Theory, Combinatorics
Softcover
ISBN 10: 6131161879 ISBN 13: 9786131161872
Verlag: OmniScriptum, 2010

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
OmniScriptum
Erscheinungsdatum
2010
Sprache
Englisch
ISBN 10 
6131161879
ISBN 13 
9786131161872
Einband
Tapa blanda
Anzahl der Seiten
88
Herausgeber
Surhone Lambert M., Timpledon Miriam T., Marseken Susan F.
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
Nicht verfügbar