Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
APPROX
2015
Springer
29views Algorithms» more  APPROX 2015»
5 years 7 months ago
Communication with Partial Noiseless Feedback
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
APPROX
2015
Springer
43views Algorithms» more  APPROX 2015»
5 years 7 months ago
Approximate Nearest Neighbor Search in Metrics of Planar Graphs
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, ...
APPROX
2015
Springer
33views Algorithms» more  APPROX 2015»
5 years 7 months ago
Reconstruction/Non-reconstruction Thresholds for Colourings of General Galton-Watson Trees
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...
Charilaos Efthymiou
APPROX
2015
Springer
32views Algorithms» more  APPROX 2015»
5 years 7 months ago
Deletion Codes in the High-noise and High-rate Regimes
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,...
Venkatesan Guruswami, Carol Wang
APPROX
2015
Springer
17views Algorithms» more  APPROX 2015»
5 years 7 months ago
Terminal Embeddings
Michael Elkin, Arnold Filtser, Ofer Neiman
APPROX
2015
Springer
32views Algorithms» more  APPROX 2015»
5 years 7 months ago
Dependent Random Graphs and Multi-Party Pointer Jumping
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...
Joshua Brody, Mario Sanchez
APPROX
2015
Springer
36views Algorithms» more  APPROX 2015»
5 years 7 months ago
How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking
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
ALDT
2015
Springer
19views Algorithms» more  ALDT 2015»
5 years 7 months ago
Group Activity Selection from Ordinal Preferences
: 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...
Andreas Darmann
books