Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem.
Sepehr AssadiSanjeev KhannaPublished in: CoRR (2018)
Keyphrases
- tight bounds
- upper bound
- mobile sensor networks
- distributed systems
- peer to peer
- cooperative
- artificial intelligence
- communication overhead
- distributed environment
- worst case
- computational cost
- search algorithm
- multi agent
- data management
- lightweight
- computer networks
- communication cost
- distributed computing
- distributed data
- case study
- distributed architecture
- e learning
- real time