Approximating minimum dominating set on string graphs (Q2301546)
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 minimum dominating set on string graphs |
scientific article; zbMATH DE number 7173303
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating minimum dominating set on string graphs |
scientific article; zbMATH DE number 7173303 |
Statements
Approximating minimum dominating set on string graphs (English)
0 references
24 February 2020
0 references
string graph
0 references
dominating set
0 references
approximation algorithm
0 references
0.9455291032791138
0 references
0.8479835987091064
0 references
0.7433698177337646
0 references
0.7430204749107361
0 references
0.7427845597267151
0 references
