Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set} (Q6145803)
From MaRDI portal
scientific article; zbMATH DE number 7785852
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set} |
scientific article; zbMATH DE number 7785852 |
Statements
Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set} (English)
0 references
9 January 2024
0 references
approximation scheme
0 references
subset-sums ratio
0 references
knapsack problems
0 references
combinatorial optimization
0 references
0 references
0 references
0 references
