On the Communication Complexity of Strong Time-Optimal Distributed Algorithms.
Stefan DobrevPeter RuzickaPublished in: Nord. J. Comput. (1998)
Keyphrases
- data structure
- worst case
- computer networks
- multi agent
- optimality criterion
- communication overhead
- space complexity
- orders of magnitude
- spatially distributed
- learning algorithm
- lower complexity
- communication networks
- memory requirements
- computationally efficient
- optimization problems
- upper bound
- np hard
- significant improvement
- computational complexity
- cooperative
- optimal solution