A polynomial-time approximation to a minimum dominating set in a graph (Q2166772)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7575104
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time approximation to a minimum dominating set in a graph |
scientific article; zbMATH DE number 7575104 |
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
0 references
0.7940345406532288
0 references
0.7935972809791565
0 references
0.792331337928772
0 references
0.7903111577033997
0 references
0.7820022106170654
0 references
