Counting and enumerating independent sets with applications to combinatorial optimization problems (Q784784)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting and enumerating independent sets with applications to combinatorial optimization problems |
scientific article; zbMATH DE number 7227041
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting and enumerating independent sets with applications to combinatorial optimization problems |
scientific article; zbMATH DE number 7227041 |
Statements
Counting and enumerating independent sets with applications to combinatorial optimization problems (English)
0 references
3 August 2020
0 references
knapsack problem
0 references
multidimensional knapsack problem
0 references
threshold graphs
0 references
independent sets
0 references
0 references
0 references
0.9308637
0 references
0.90978897
0 references
0.9050609
0 references
0.9041877
0 references
0.9033182
0 references
0.9029238
0 references
0.8993548
0 references
