A tight unconditional lower bound on distributed randomwalk computation.
Danupon NanongkaiAtish Das SarmaGopal PanduranganPublished in: PODC (2011)
Keyphrases
- lower bound
- upper bound
- worst case
- branch and bound algorithm
- np hard
- distributed systems
- branch and bound
- upper and lower bounds
- optimal solution
- objective function
- lower bounding
- lower and upper bounds
- fault tolerant
- lightweight
- loosely coupled
- efficient computation
- real time
- distributed environment
- peer to peer
- sample complexity
- neural network
- data sets
- linear programming relaxation
- database
- competitive ratio
- sufficiently accurate