
Deterministic Distributed Dominating Set Approximation in the CONGEST Model
We develop deterministic approximation algorithms for the minimum domina...
read it

A tight local algorithm for the minimum dominating set problem in outerplanar graphs
We show that there is a deterministic local algorithm (constanttime dis...
read it

Guidesort: Simpler Optimal Deterministic Sorting for the Parallel Disk Model
A new algorithm, Guidesort, for sorting in the uniprocessor variant of t...
read it

Distributed Distancer Dominating Set on Sparse HighGirth Graphs
The dominating set problem and its generalization, the distancer domina...
read it

Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and nondeterminism
We present implications from the known conjectures like APSP, 3SUM and E...
read it

Deterministic Distributed Ruling Sets of Line Graphs
An (α,β)ruling set of a graph G=(V,E) is a set R⊆ V such that for any n...
read it

A consistent deterministic regression tree for nonparametric prediction of time series
We study online prediction of bounded stationary ergodic processes. To d...
read it
Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs
We provide a deterministic CONGEST algorithm to constant factor approximate the minimum dominating set on graphs of bounded arboricity in O(log n) rounds. This improves over the wellknown randomized algorithm of Lenzen and Wattenhofer[DISC2010] by making it a deterministic algorithm.
READ FULL TEXT
Comments
There are no comments yet.