We develop a general deterministic distributed method for locally rounding fractional
solutions of graph problems for which the analysis can be broken down into analyzing pairs …

The Local Computation Algorithm (LCA) model is a popular model in the field of sublinear-
time algorithms that measures the complexity of an algorithm by the number of probes the …

We study the metric Steiner tree problem in the sublinear query model. In this problem, for a
set of $ n $ points $ V $ in a metric space given to us by means of query access to an …

We consider the question of orienting the edges in a graph $ G $ such that every vertex has
bounded out-degree. For graphs of arboricity $\alpha $, there is an orientation in which …

The Massively Parallel Computation (MPC) model is a popular abstraction for large-scale
distributed computing. The Set Cover problem is a classical combinatorial optimization …

This article considers message and energy-efficient distributed algorithms for the SetCover
Problem. Given a ground set U of n elements and a set S of m subsets of U, we aim to find …

In the metric Steiner Tree problem, we are given an n× n metric w on a set V of vertices
along with a set T⊆ V of k terminals, and the goal is to find a tree of minimum cost that …

The Chinese restaurant process is a stochastic process closely related to the Dirichlet
process that groups sequentially arriving objects into a variable number of classes, such that …

In many practical applications, heuristic or approximation algorithms are used to efficiently
solve the task at hand. However their solutions frequently do not satisfy natural monotonicity …

In this work we consider active {\em local learning}: given a query point $ x $, and active
access to an unlabeled training set $ S $, output the prediction $ h (x) $ of a near-optimal …