121
click to vote
SODA
2016
ACM
10 years 19 days ago
2016
ACM
We study the d-dimensional vector bin packing problem, a well-studied generalization of bin packing arising in resource allocation and scheduling problems. Here we are given a set...
139
click to vote
SODA
2016
ACM
10 years 19 days ago
2016
ACM
We study the multiway cut problem in directed graphs and one of its special cases, the node-weighted multiway cut problem in undirected graphs. In DIRECTED MULTIWAY CUT (DIR-MC) t...
136
click to vote
SODA
2016
ACM
10 years 19 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 19 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 19 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...
118
Voted
SODA
2016
ACM
10 years 19 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, ...
136
Voted
SODA
2016
ACM
10 years 19 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...
132
click to vote
SODA
2016
ACM
10 years 19 days 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...
131
click to vote
SODA
2016
ACM
10 years 19 days 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...