A fast search algorithm for the quorumcast routing problem. (Q2583541)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2247929
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast search algorithm for the quorumcast routing problem. |
scientific article; zbMATH DE number 2247929 |
Statements
A fast search algorithm for the quorumcast routing problem. (English)
0 references
17 January 2006
0 references
Algorithms
0 references
Quorumcast routing
0 references
Multicast
0 references
Exhaustive search algorithm
0 references
Pruning search space
0 references
NP-completeness
0 references
0.7973635196685791
0 references
0.7847062349319458
0 references
0.7247716188430786
0 references
0.7223761677742004
0 references
