Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
SODA
2016
ACM
71views Algorithms» more  SODA 2016»
5 years 7 months ago
Improved Deterministic Algorithms for Linear Programming in Low Dimensions
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...
Timothy M. Chan
SODA
2016
ACM
61views Algorithms» more  SODA 2016»
5 years 7 months ago
Stabilizing Consensus with Many Opinions
Luca Becchetti, Andrea E. F. Clementi, Emanuele Na...
SODA
2016
ACM
65views Algorithms» more  SODA 2016»
5 years 7 months ago
A Fast Approximation for Maximum Weight Matroid Intersection
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 ...
Chandra Chekuri, Kent Quanrud
SODA
2016
ACM
58views Algorithms» more  SODA 2016»
5 years 7 months ago
Improved Approximation for Vector Bin Packing
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...
Nikhil Bansal, Marek Eliás, Arindam Khan 00...
SODA
2016
ACM
69views Algorithms» more  SODA 2016»
5 years 7 months ago
Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut
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...
Chandra Chekuri, Vivek Madan
SODA
2016
ACM
65views Algorithms» more  SODA 2016»
5 years 7 months ago
Expanders via Local Edge Flips
Zeyuan Allen Zhu, Aditya Bhaskara, Silvio Lattanzi...
SODA
2016
ACM
55views Algorithms» more  SODA 2016»
5 years 7 months ago
Constant Factor Approximation for Subset Feedback Set Problems via a new LP relaxation
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} ⊂...
Chandra Chekuri, Vivek Madan
SODA
2016
ACM
61views Algorithms» more  SODA 2016»
5 years 7 months ago
Locality-sensitive Hashing without False Negatives
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 ...
Rasmus Pagh
SODA
2016
ACM
66views Algorithms» more  SODA 2016»
5 years 7 months ago
New directions in nearest neighbor searching with applications to lattice sieving
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...
Anja Becker, Léo Ducas, Nicolas Gama, Thijs...
SODA
2016
ACM
48views Algorithms» more  SODA 2016»
5 years 7 months ago
Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions
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, ...
Ashwinkumar Badanidiyuru, Christos H. Papadimitrio...
books