136
click to vote
SODA
2016
ACM
10 years 18 days ago
2016
ACM
We consider subset feedback edge and vertex set problems in undirected graphs. The input to these problems is an undirected graph G = (V, E) and a set S = {s1, s2, . . . , sk} ⊂...
155
click to vote
SODA
2016
ACM
10 years 18 days ago
2016
ACM
We consider a new construction of locality-sensitive hash functions for Hamming space that is covering in the sense that is it guaranteed to produce a collision for every pair of ...
136
click to vote
SODA
2016
ACM
10 years 18 days ago
2016
ACM
To solve the approximate nearest neighbor search problem (NNS) on the sphere, we propose a method using locality-sensitive filters (LSF), with the property that nearby vectors ha...
117
click to vote
SODA
2016
ACM
10 years 18 days 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, ...
135
click to vote
SODA
2016
ACM
10 years 18 days 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...