Local Computation Algorithms for Graphs of Non-constant Degrees
Name
1502.04022.pdf
Description
Submitted version
Size
276.23 KB
Format
Unknown
Checksum (MD5)
41a75b27fcfdcbc189e0f8a096a9a552
Author(s)
Levi, Reut
Rubinfeld, Ronitt
Yodpinyanee, Anak
Date Issued
2017
Journal
Algorithmica
Publisher
Springer Nature
Citation
Levi, Reut, Ronitt Rubinfeld, and Anak Yodpinyanee. "Local Computation Algorithms for Graphs of Non-Constant Degrees." Algorithmica 77 4 (2017): 971-94.
Version
Original manuscript
Abstract
© 2016, Springer Science+Business Media New York. In the model of local computation algorithms (LCAs), we aim to compute the queried part of the output by examining only a small (sublinear) portion of the input. Many recently developed LCAs on graph problems achieve time and space complexities with very low dependence on n, the number of vertices. Nonetheless, these complexities are generally at least exponential in d, the upper bound on the degree of the input graph. Instead, we consider the case where parameter d can be moderately dependent on n, and aim for complexities with subexponential dependence on d, while maintaining polylogarithmic dependence on n. We present:a randomized LCA for computing maximal independent sets whose time and space complexities are quasi-polynomial in d and polylogarithmic in n;for constant ε> 0 , a randomized LCA that provides a (1 - ε) -approximation to maximum matching with high probability, whose time and space complexities are polynomial in d and polylogarithmic in n.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/S00453-016-0126-Y
