Online Algorithms with Lookaround

09/14/2021
by   Amirreza Akbari, et al.
0

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.

READ FULL TEXT

page 1

page 11

page 19

research
02/18/2021

Locality in Online Algorithms

Online algorithms make decisions based on past inputs. In general, the d...
research
03/13/2018

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

We introduce notions of certificates allowing to bound eccentricities in...
research
03/26/2018

Local verification of global proofs

In this work we study the cost of local and global proofs on distributed...
research
05/01/2021

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

We study the dominating set problem in an online setting. An algorithm i...
research
05/21/2020

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 ...
research
10/15/2022

Unveiling the Sampling Density in Non-Uniform Geometric Graphs

A powerful framework for studying graphs is to consider them as geometri...
research
09/17/2023

Connectivity of Random Geometric Hypergraphs

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

Please sign up or login with your details

Forgot password? Click here to reset