@article{MansourPattShamirVardi2017,
author = {Mansour, Yishay and Patt-Shamir, Boaz and Vardi, Shai},
year = {2017},
title = {Constant-Time Local Computation Algorithms},
journal = {Theory of Computing Systems},
issn = {1432-4350},
doi = {10.1007/s00224-017-9788-3},
month = {6},
pages = {1--19},
url = {http:https://doi.org/10.1007/s00224-017-9788-3},
abstract = {Local computation algorithms (LCAs) produce small parts of a single (possibly approximate) solution to a given search problem using time and space sublinear in the size of the input. In this work we present LCAs whose time complexity (and usually also space complexity) is independent of the input size. Specifically, we give (1) a (1 − 𝜖)-approximation LCA to the maximum weight acyclic edge set, (2) LCAs for approximating multicut and integer multicommodity flow on trees, and (3) a local reduction of weighted matching to any unweighted matching LCA, such that the running time of the weighted matching LCA is d times (where d is the maximal degree) the running time of the unweighted matching LCA, (and therefore independent of the edge weight function).}
}