Sciweavers

SODA
2016
ACM
97views Algorithms» more  SODA 2016»
8 years 8 months ago
Bounds for Random Constraint Satisfaction Problems via Spatial Coupling
We report on a novel technique called spatial coupling and its application in the analysis of random constraint satisfaction problems (CSP). Spatial coupling was invented as an en...
Dimitris Achlioptas, Seyed Hamed Hassani, Nicolas ...
SODA
2016
ACM
56views Algorithms» more  SODA 2016»
8 years 8 months ago
Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching
We initiate the study of trade-offs between sparsity and the number of measurements in sparse recovery schemes for generic norms. Specifically, for a norm · , sparsity paramete...
Arturs Backurs, Piotr Indyk, Ilya Razenshteyn, Dav...
SODA
2016
ACM
58views Algorithms» more  SODA 2016»
8 years 8 months ago
Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics
We consider the Traveling Salesman Problem with Neighborhoods (TSPN) in doubling metrics. The goal is to find a shortest tour that visits each of a given collection of subsets (r...
T.-H. Hubert Chan, Shaofeng H.-C. Jiang
SODA
2016
ACM
58views Algorithms» more  SODA 2016»
8 years 8 months ago
Make-to-Order Integrated Scheduling and Distribution
Production and distribution are fundamental operational functions in supply chains. The main challenge is to design algorithms that optimize operational performance by jointly sch...
Yossi Azar, Amir Epstein, Lukasz Jez, Adi Vardi