APPROX
2007
Springer
14 years 4 months ago
2007
Springer
APPROX
2007
Springer
14 years 4 months ago
2007
Springer
It is known that online knapsack is not competitive. This negative result remains true even if the items are removable. In this paper we consider online removable knapsack with
APPROX
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
APPROX
2007
Springer
14 years 4 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
APPROX
2007
Springer
14 years 4 months ago
2007
Springer
APPROX
2007
Springer
14 years 4 months ago
2007
Springer
We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relati...
APPROX
2007
Springer
14 years 4 months ago
2007
Springer
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
APPROX
2007
Springer
14 years 4 months ago
2007
Springer
APPROX
2007
Springer
14 years 4 months ago
2007
Springer
: In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input dom...
APPROX
2007
Springer
14 years 4 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...