The Communication Complexity of Local Search

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Volume abs/1804.02676, 2019, Pages 650-661.

Cited by: 8|Bibtex|Views17|DOI:https://doi.org/10.1145/3313276.3316354
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|dl.acm.org|arxiv.org

Abstract:

We study a communication variant of local search. There is some fixed, commonly known graph G. Alice holds fA and Bob holds fB, both are functions that specify a value for each vertex. The goal is to find a local maximum of fA+fB with respect to G, i.e., a vertex v for which (fA+fB)(v)≥ (fA+fB)(u) for each neighbor u of v. Our main resu...More

Code:

Data:

Your rating :
0

 

Tags
Comments