Approximating the minimum independent dominating set in perturbed graphs (Q744108)
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: Approximating the minimum independent dominating set in perturbed graphs |
scientific article; zbMATH DE number 6351440
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the minimum independent dominating set in perturbed graphs |
scientific article; zbMATH DE number 6351440 |
Statements
Approximating the minimum independent dominating set in perturbed graphs (English)
0 references
6 October 2014
0 references
independent set
0 references
independent dominating set
0 references
dominating set
0 references
approximation algorithm
0 references
perturbed graph
0 references
smooth analysis
0 references
0.99999994
0 references
0.9579611
0 references
0 references
0.9289609
0 references
0.90791976
0 references
0.9077577
0 references
