DeepAI AI Chat
Log In Sign Up

Online Algorithms with Lookaround

by   Amirreza Akbari, et al.

We introduce a new model of computation: the online LOCAL model (OLOCAL). In this model, the adversary reveals the nodes of the input graph one by one, in the same way as in classical online algorithms, but for each new node the algorithm can also inspect its radius-T neighborhood before choosing the output; instead of looking ahead in time, we have the power of looking around in space. It is natural to compare OLOCAL with the LOCAL model of distributed computing, in which all nodes make decisions simultaneously in parallel based on their radius-T neighborhoods.


page 1

page 11

page 19


Locality in Online Algorithms

Online algorithms make decisions based on past inputs. In general, the d...

Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates

We introduce notions of certificates allowing to bound eccentricities in...

Local verification of global proofs

In this work we study the cost of local and global proofs on distributed...

Online Domination: The Value of Getting to Know All your Neighbors

We study the dominating set problem in an online setting. An algorithm i...

Online Coloring and a New Type of Adversary for Online Graph Problems

We introduce a new type of adversary for online graph problems. The new ...

Unveiling the Sampling Density in Non-Uniform Geometric Graphs

A powerful framework for studying graphs is to consider them as geometri...

Connectivity of Random Geometric Hypergraphs

We consider a random geometric hypergraph model based on an underlying b...