Efficient algorithms for a simple network design problem (Q2811297)
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: Efficient algorithms for a simple network design problem |
scientific article; zbMATH DE number 6591782
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for a simple network design problem |
scientific article; zbMATH DE number 6591782 |
Statements
Efficient algorithms for a simple network design problem (English)
0 references
10 June 2016
0 references
approximation algorithm
0 references
efficient algorithm
0 references
NP-completeness
0 references
simple network design
0 references
small-world network
0 references
0 references
0.7843186855316162
0 references
0.7777215242385864
0 references
0.7637324929237366
0 references
0.7617442011833191
0 references
