TY - JOUR
T1 - Best of two local models
T2 - Centralized local and distributed local algorithms
AU - Even, Guy
AU - Medina, Moti
AU - Ron, Dana
N1 - Publisher Copyright:
© 2018 Elsevier Inc.
PY - 2018/10
Y1 - 2018/10
N2 - We consider two models of computation: centralized local algorithms and local distributed algorithms. Algorithms in one model are adapted to the other model to obtain improved algorithms. Distributed vertex coloring is employed to design improved centralized local algorithms for: maximal independent set, maximal matching, and an approximation scheme for maximum (weighted) matching over bounded degree graphs. The improvement is threefold: the algorithms are deterministic, stateless, and the number of probes grows polynomially in log⁎n, where n is the number of vertices of the input graph. The recursive centralized local improvement technique by Nguyen and Onak (FOCS 2008) is employed to obtain a distributed approximation scheme for maximum (weighted) matching.
AB - We consider two models of computation: centralized local algorithms and local distributed algorithms. Algorithms in one model are adapted to the other model to obtain improved algorithms. Distributed vertex coloring is employed to design improved centralized local algorithms for: maximal independent set, maximal matching, and an approximation scheme for maximum (weighted) matching over bounded degree graphs. The improvement is threefold: the algorithms are deterministic, stateless, and the number of probes grows polynomially in log⁎n, where n is the number of vertices of the input graph. The recursive centralized local improvement technique by Nguyen and Onak (FOCS 2008) is employed to obtain a distributed approximation scheme for maximum (weighted) matching.
KW - Centralized local algorithms
KW - Distributed local algorithms
KW - Graph algorithms
KW - Maximum matching
KW - Maximum weighted matching
KW - Sublinear approximation algorithms
UR - http://www.scopus.com/inward/record.url?scp=85050402219&partnerID=8YFLogxK
U2 - 10.1016/j.ic.2018.07.001
DO - 10.1016/j.ic.2018.07.001
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85050402219
SN - 0890-5401
VL - 262
SP - 69
EP - 89
JO - Information and Computation
JF - Information and Computation
ER -