Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs (Q5389975): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2245114686 / rank | |||
Normal rank | |||
| Property / title | |||
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs (English) | |||
| Property / title: Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs (English) / rank | |||
Normal rank | |||
Latest revision as of 11:23, 30 July 2024
scientific article; zbMATH DE number 6027214
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs |
scientific article; zbMATH DE number 6027214 |
Statements
24 April 2012
0 references
polynomial-time approximation scheme
0 references
bounded-genus graph
0 references
embedded graph
0 references
Steiner tree
0 references
survivable-network design
0 references
subset TSP
0 references
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs (English)
0 references
