Dual-based approximation algorithms for cut-based network connectivity problems (Q722530)
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: Dual-based approximation algorithms for cut-based network connectivity problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dual-based approximation algorithms for cut-based network connectivity problems |
scientific article |
Statements
Dual-based approximation algorithms for cut-based network connectivity problems (English)
0 references
26 July 2018
0 references
approximation algorithms
0 references
network design
0 references
power assignment
0 references
linear programming
0 references
graph theory
0 references
0 references
0 references
0 references
0.89970696
0 references
0.8976656
0 references
0.88613355
0 references
0.88482744
0 references
0.88010824
0 references
