113
click to vote
APPROX
15 years 6 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
15 years 6 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
15 years 6 months ago
2007 Springer
We study the cover time of a random walk on the random digraph Dn,p when np =
APPROX
15 years 6 months ago
2007 Springer
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
APPROX
15 years 6 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 ...
|
Algorithms