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 ...
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...
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
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...
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...
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...