26 search results - page 2 / 6 » approx 2004 |
APPROX
2004
Springer
13 years 11 months ago
2004
Springer
We consider the problem of fitting metric data on n points to a path (line) metric. Our objective is to minimize the total additive distortion of this mapping. The total additive ...
APPROX
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
APPROX
2004
Springer
13 years 11 months ago
2004
Springer
In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...
APPROX
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Motivated by an open problem recently suggested by Goldreich et al., we study truthful implementations of a random binary function supporting compound XOR queries over su...
APPROX
2004
Springer
13 years 11 months ago
2004
Springer
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a ...