A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (Q5002603): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2749358524 / rank | |||
Normal rank | |||
| Property / title | |||
A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (English) | |||
| Property / title: A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (English) / rank | |||
Normal rank | |||
Latest revision as of 08:41, 30 July 2024
scientific article; zbMATH DE number 7375808
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs |
scientific article; zbMATH DE number 7375808 |
Statements
28 July 2021
0 references
three-edge connectivity
0 references
polynomial-time approximation schemes
0 references
planar graphs
0 references
0 references
0 references
0 references
A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (English)
0 references
