A tight lower bound for semi-synchronous collaborative grid exploration.
Sebastian BrandtJara UittoRoger WattenhoferPublished in: Distributed Comput. (2020)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- worst case
- objective function
- lower and upper bounds
- lower bounding
- asynchronous communication
- np hard
- grid computing
- geographically dispersed
- linear programming relaxation
- grid structure
- collaborative learning
- optimal solution
- sample complexity
- vc dimension
- computer supported collaborative learning
- exploratory search
- information retrieval
- neural network
- shared workspace
- grid points
- collaborative environment
- upper and lower bounds
- search tasks