Bibliography of distributed approximation beyond bounded degree

TL;DR

This paper compiles an informal bibliography of distributed approximation algorithms focusing on classes of graphs with geometric properties, bounded parameters, or forbidden structures, extending beyond the classic bounded degree graphs.

Contribution

It provides an organized overview of techniques for distributed approximation in non-bounded degree graph classes with geometric or structural constraints.

Findings

Focus on geometric graph classes like planar and unit-disk graphs

Techniques for graphs with bounded parameters such as arboricity and expansion

Coverage of algorithms for graphs with forbidden minors

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).