SODA
2016
ACM
8 years 8 months ago
2016
ACM
The Adaptive Seeding problem is an algorithmic challenge motivated by influence maximization in social networks: One seeks to select among certain accessible nodes in a network, ...
SODA
2016
ACM
8 years 8 months ago
2016
ACM
A conjecture of Bandelt and Dress states that the maximum quartet distance between any two phylogenetic trees on n leaves is at most (2 3 + o(1)) n 4 . Using the machinery of fla...
SODA
2016
ACM
8 years 8 months ago
2016
ACM
We explore clustering problems in the streaming sliding window model in both general metric spaces and Euclidean space. We present the first polylogarithmic space O(1)-approximat...
SODA
2016
ACM
8 years 8 months ago
2016
ACM
A matrix A ∈ Cq×N satisfies the restricted isometry property of order k with constant ε if it preserves the 2 norm of all k-sparse vectors up to a factor of 1 ± ε. We prove...
SODA
2016
ACM
8 years 8 months ago
2016
ACM
SODA
2016
ACM
8 years 8 months ago
2016
ACM
We consider the problem of implementing distributed protocols, despite adversarial channel errors, on synchronous-messaging networks with arbitrary topology. In our first result ...
SODA
2016
ACM
8 years 8 months ago
2016
ACM
SODA
2016
ACM
8 years 8 months ago
2016
ACM
SODA
2016
ACM
8 years 8 months ago
2016
ACM
We study efficient, deterministic interactive coding schemes that simulate any interactive protocol both under random and adversarial errors, and can achieve a constant communicat...
SODA
2016
ACM
8 years 8 months ago
2016
ACM
Set cover, over a universe of size n, may be modelled as a data-streaming problem, where the m sets that comprise the instance are to be read one by one. A semi-streaming algorith...