3874 search results - page 182 / 775 » Approximation Algorithms for k-hurdle Problems |
115
Voted
COMPGEOM
2006
ACM
15 years 8 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
101
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
115
click to vote
LATIN
1998
Springer
15 years 6 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
147
click to vote
FSTTCS
1993
Springer
15 years 6 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
124
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...