Approximating connectivity domination in weighted bounded-genus graphs (Q5361863)
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 6784103
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating connectivity domination in weighted bounded-genus graphs |
scientific article; zbMATH DE number 6784103 |
Statements
Approximating connectivity domination in weighted bounded-genus graphs (English)
0 references
29 September 2017
0 references
approximation algorithm
0 references
bounded genus
0 references
connected dominating set
0 references
feedback vertex set
0 references
graph
0 references
planar graph
0 references
polynomial-time approximation scheme
0 references
0.8366016745567322
0 references
0.8354847431182861
0 references
0.7936943769454956
0 references
0.7701234817504883
0 references
0.7696385383605957
0 references
