An efficient approximation algorithm for the survivable network design problem (Q1290632)
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: An efficient approximation algorithm for the survivable network design problem |
scientific article; zbMATH DE number 1294683
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient approximation algorithm for the survivable network design problem |
scientific article; zbMATH DE number 1294683 |
Statements
An efficient approximation algorithm for the survivable network design problem (English)
0 references
18 October 1999
0 references
survivable network design
0 references
minimum-cost subgraph
0 references
edge-connectivity
0 references
polynomial-time approximation
0 references
0 references
0 references
0 references
0.96622336
0 references
0.9407464
0 references
0.9407464
0 references
0.9351671
0 references
0.9338341
0 references
0.9338341
0 references
