Approximating connectivity domination in weighted bounded-genus graphs (Q5361863): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/2897518.2897635 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2417586110 / rank | |||
Normal rank | |||
Latest revision as of 22:56, 19 March 2024
scientific article; zbMATH DE number 6784103
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
