An efficient algorithm for constructing delay bounded minimum cost multicast trees (Q705564)
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 algorithm for constructing delay bounded minimum cost multicast trees |
scientific article; zbMATH DE number 2131612
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for constructing delay bounded minimum cost multicast trees |
scientific article; zbMATH DE number 2131612 |
Statements
An efficient algorithm for constructing delay bounded minimum cost multicast trees (English)
0 references
31 January 2005
0 references
Multicast trees
0 references
Dijkstra's algorithm
0 references
Discrete delays
0 references
Bounded delays
0 references
Constrained minimization
0 references
Low-cost multicasting
0 references
0.8851990103721619
0 references
0.8254936933517456
0 references
0.824971079826355
0 references
