Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:49, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs |
scientific article |
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
