3874 search results - page 231 / 775 » Approximation Algorithms for k-hurdle Problems |
153
click to vote
COLOGNETWENTE
2007
15 years 5 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
123
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
Approximations can aim at having close to optimal value or, alternatively, they can aim at structurally resembling an optimal solution. Whereas value-approximation has been extensi...
182
click to vote
ICDT
2011
ACM
14 years 7 months ago
2011
ACM
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
151
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
137
Voted
TCS
2010
15 years 2 months ago
2010
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...