Sciweavers

SODA
2010
ACM
238views Algorithms» more  SODA 2010»
14 years 1 months ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...
SODA
2010
ACM
167views Algorithms» more  SODA 2010»
14 years 1 months ago
Inapproximability for planar embedding problems
We consider the problem of computing a minimumdistortion bijection between two point-sets in R2 . We prove the first non-trivial inapproximability result for this problem, for the...
Jeff Edmonds, Anastasios Sidiropoulos, Anastasios ...
SODA
2010
ACM
122views Algorithms» more  SODA 2010»
14 years 1 months ago
Price of Anarchy for Greedy Auctions
Brendan Lucier, Allan Borodin
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
14 years 1 months ago
Resource Minimization for Fire Containment
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
Parinya Chalermsook, Julia Chuzhoy
SODA
2010
ACM
151views Algorithms» more  SODA 2010»
14 years 1 months ago
The Complexity of Guarding Terrains
James King, Erik Krohn
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 1 months ago
Lower Bounds for Sparse Recovery
We consider the following k-sparse recovery problem: design an m ? n matrix A, such that for any signal x, given Ax we can efficiently recover ^x satisfying
khanh do ba, piotr indyk, eric price
SODA
2010
ACM
222views Algorithms» more  SODA 2010»
14 years 1 months ago
Finding the Jaccard Median
The median problem in the weighted Jaccard metric was
Flavio Chierichetti, Ravi Kumar, Sandeep Pandey, S...
SODA
2010
ACM
232views Algorithms» more  SODA 2010»
14 years 1 months ago
Faster exponential time algorithms for the shortest vector problem
We present new faster algorithms for the exact solution of the shortest vector problem in arbitrary lattices. Our main result shows that the shortest vector in any n-dimensional l...
Daniele Micciancio, Panagiotis Voulgaris
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 1 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...