Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies (Q705041)
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: Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies |
scientific article; zbMATH DE number 2130928
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies |
scientific article; zbMATH DE number 2130928 |
Statements
Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies (English)
0 references
25 January 2005
0 references
node-based upgrade
0 references
edge-based upgrade
0 references
even-odd partition
0 references
NP-hard
0 references
0.8220812678337097
0 references
0.8027910590171814
0 references
0.7827393412590027
0 references
0.7827393412590027
0 references
