SODA
2012
ACM
11 years 6 months ago
2012
ACM
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...
SODA
2012
ACM
11 years 6 months ago
2012
ACM
SODA
2012
ACM
11 years 6 months ago
2012
ACM
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...
SODA
2012
ACM
11 years 6 months ago
2012
ACM
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...
SODA
2012
ACM
11 years 6 months ago
2012
ACM
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...
SODA
2012
ACM
11 years 6 months ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
SODA
2012
ACM
11 years 6 months ago
2012
ACM
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
SODA
2012
ACM
11 years 6 months ago
2012
ACM
We study the role that parallelism plays in time complexariants of Winfree’s abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the “hiera...
SODA
2012
ACM
11 years 6 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
SODA
2012
ACM
11 years 6 months ago
2012
ACM
