79
Voted
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Random projection methods give distributions over k
APPROX
2008
Springer
14 years 11 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...
72
Voted
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
APPROX
2008
Springer
14 years 11 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
14 years 11 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...
76
Voted
APPROX
2008
Springer
14 years 11 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
14 years 11 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...