Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424)
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: Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs |
scientific article; zbMATH DE number 6375630
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs |
scientific article; zbMATH DE number 6375630 |
Statements
Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (English)
0 references
2 December 2014
0 references
polynomial-time approximation scheme
0 references
bounded-genus graphs
0 references
Steiner tree
0 references
subset TSP
0 references
0 references
0 references
0 references
0 references
0 references
0.9959604740142822
0 references
0.8366016745567322
0 references
0.8075061440467834
0 references
0.8071381449699402
0 references
