Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem.
Sepehr AssadiSanjeev KhannaPublished in: SODA (2018)
Keyphrases
- tight bounds
- upper bound
- distributed systems
- distributed environment
- cooperative
- computational complexity
- data sets
- worst case
- multi agent
- peer to peer
- distributed data
- mobile sensor networks
- distributed architecture
- distributed computing
- distributed database systems
- communication cost
- computer networks
- decision problems
- expert systems
- information retrieval
- neural network