SODA
2016
ACM
8 years 8 months ago
2016
ACM
At SODA’93, Chazelle and Matouˇsek presented a derandomization of Clarkson’s sampling-based algorithm [FOCS’88] for solving linear programs with n constraints and d variabl...
SODA
2016
ACM
8 years 8 months ago
2016
ACM
SODA
2016
ACM
8 years 8 months ago
2016
ACM
We present an approximation algorithm for the maximum weight matroid intersection problem in the independence oracle model. Given two matroids defined over a common ground set N ...
SODA
2016
ACM
8 years 8 months 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...
SODA
2016
ACM
8 years 8 months 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...
SODA
2016
ACM
8 years 8 months ago
2016
ACM
SODA
2016
ACM
8 years 8 months 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} ⊂...
SODA
2016
ACM
8 years 8 months 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 ...
SODA
2016
ACM
8 years 8 months 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...
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, ...