@inproceedings{81ffb5e21f3540468cdbdcd8c51a2019,
title = "Constant-time local computation algorithms",
abstract = "Local computation algorithms (LCAs) produce small parts of a single 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 maximal weighted base of a graphic matroid (i.e., maximal 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 also independent of the edge weight function.",
author = "Yishay Mansour and Boaz Patt-Shamir and Shai Vardi",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 13th International Workshop on Approximation and Online Algorithms, WAOA 2015 ; Conference date: 17-09-2015 Through 18-09-2015",
year = "2015",
doi = "10.1007/978-3-319-28684-6_10",
language = "الإنجليزيّة",
isbn = "9783319286839",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "110--121",
editor = "Martin Skutella and Laura Sanit{\`a}",
booktitle = "Approximation and Online Algorithms - 13th International Workshop, WAOA 2015, Revised Selected Papers",
address = "ألمانيا",
}