Algorithms and Lower Bounds for P-Gossiping in Circulant Networks.
Emilia A. MonakhovaPublished in: ISPAN (1997)
Keyphrases
- lower bound
- online algorithms
- benchmark datasets
- worst case
- upper bound
- computationally efficient
- theoretical analysis
- data structure
- times faster
- scheduling problem
- computational cost
- significant improvement
- optimization problems
- data sets
- optimal solution
- frequency domain
- orders of magnitude
- computationally expensive
- combinatorial optimization
- fourier transform
- memory requirements
- lower and upper bounds
- objective function