A polynomial-time approximation to a minimum dominating set in a graph (Q2166772)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time approximation to a minimum dominating set in a graph |
scientific article |
Statements
A polynomial-time approximation to a minimum dominating set in a graph (English)
0 references
25 August 2022
0 references
graph
0 references
dominating set
0 references
approximation ratio
0 references
approximation algorithm
0 references
time complexity
0 references
0 references
0 references
