We introduce the notion of one-way communication schemes with partial noiseless feedback. In this setting, Alice wishes to communicate a message to Bob by using a communication sc...
Bernhard Haeupler, Pritish Kamath, Ameya Velingker
We investigate the problem of approximate Nearest-Neighbor Search (NNS) in graphical metrics: The task is to preprocess an edge-weighted graph G = (V, E) on m vertices and a small...
Ittai Abraham, Shiri Chechik, Robert Krauthgamer, ...
The broadcasting models on trees arise in many contexts such as discrete mathematics, biology, information theory, statistical physics and computer science. In this work, we consi...
The noise model of deletions poses significant challenges in coding theory, with basic questions like the capacity of the binary deletion channel still being open. In this paper,...
We initiate a study of a relaxed version of the standard Erdős-Rényi random graph model, where each edge may depend on a few other edges. We call such graphs dependent random gr...
In the Maximum Weight Independent Set of Rectangles (MWISR) problem, we are given a collection of weighted axis-parallel rectangles in the plane. Our goal is to compute a maximum ...
Anna Adamaszek, Parinya Chalermsook, Andreas Wiese
: The minisum and the minimax rules are two different rules for the election of a committee considered by Brams, Kilgour, and Sanver. As input they assume approval ballots from th...