Bibliography of distributed approximation beyond bounded degree
Data Structures and Algorithms
2023-11-10 v4 Distributed, Parallel, and Cluster Computing
Abstract
This document is an informal bibliography of the papers dealing with distributed approximation algorithms. A classic setting for such algorithms is bounded degree graphs, but there is a whole set of techniques that have been developed for other classes. These later classes are the focus of the current work. These classes have a geometric nature (planar, bounded genus and unit-disk graphs) and/or have bounded parameters (arboricity, expansion, growth, independence) or forbidden structures (forbidden minors).
Cite
@article{arxiv.2001.08510,
title = {Bibliography of distributed approximation beyond bounded degree},
author = {Laurent Feuilloley},
journal= {arXiv preprint arXiv:2001.08510},
year = {2023}
}
Comments
An annotated bibliography. Fourth version (October 2023). Approx 5 new papers since 2021