The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
Statistical data frequently includes outliers; these can distort the results of estimation procedures and optimization problems. For this reason, loss functions which deemphasize ...
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
ABSTRACT∗ Arman Yousefi† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of e...
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...