APPROX
2008
Springer
13 years 12 months ago
2008
Springer
Random projection methods give distributions over k
APPROX
2008
Springer
13 years 12 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
APPROX
2008
Springer
13 years 12 months ago
2008
Springer
APPROX
2008
Springer
13 years 12 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
APPROX
2008
Springer
13 years 12 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
APPROX
2008
Springer
13 years 12 months ago
2008
Springer
A (q, , )-locally decodable code (LDC) C : {0, 1}n {0, 1}m is an encoding from n-bit strings to m-bit strings such that each bit xk can be recovered with probability at least 1 2 +...
APPROX
2008
Springer
13 years 12 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
APPROX
2008
Springer
13 years 12 months ago
2008
Springer
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
APPROX
2008
Springer
13 years 12 months ago
2008
Springer
APPROX
2008
Springer
13 years 12 months ago
2008
Springer
We give an algorithm that with high probability properly learns random monotone DNF with t(n) terms of length log t(n) under the uniform distribution on the Boolean cube {0, 1}n ....