Approximating the minimum independent dominating set in perturbed graphs (Q4925243)
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 6174160
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the minimum independent dominating set in perturbed graphs |
scientific article; zbMATH DE number 6174160 |
Statements
Approximating the Minimum Independent Dominating Set in Perturbed Graphs (English)
0 references
11 June 2013
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.9964391589164734
0 references
0.8037304878234863
0 references
0.7829927206039429
0 references
0.778856635093689
0 references
0.7760764956474304
0 references
