3874 search results - page 135 / 775 » Approximation Algorithms for k-hurdle Problems |
115
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
We present reductions from lattice problems in the 2 norm to the corresponding problems in other norms such as 1, (and in fact in any other p norm where 1 p ). We consider latt...
129
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
106
click to vote
COCOON
2005
Springer
15 years 7 months ago
2005
Springer
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...
IQIS
2005
ACM
15 years 7 months ago
2005
ACM
In this paper, we consider two important problems that commonly occur in bibliographic digital libraries, which seriously degrade their data qualities: Mixed Citation (MC) problem...
127
click to vote
SIAMCOMP
2008
15 years 1 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...