The two-edge connectivity survivable-network design problem in planar graphs (Q4962608)
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: The two-edge connectivity survivable-network design problem in planar graphs |
scientific article; zbMATH DE number 6972769
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The two-edge connectivity survivable-network design problem in planar graphs |
scientific article; zbMATH DE number 6972769 |
Statements
The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs (English)
0 references
5 November 2018
0 references
planar graphs
0 references
polynomial-time approximation scheme
0 references
survivable network design
0 references
0.9697067141532898
0 references
0.8766537308692932
0 references
0.8218522071838379
0 references
