1647 search results - page 99 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
119
click to vote
DAGSTUHL
2007
15 years 6 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
116
click to vote
STOC
2002
ACM
16 years 5 months ago
2002
ACM
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
147
Voted
GPEM
2007
15 years 4 months ago
2007
Our rapidly growing knowledge regarding genetic variation in the human genome offers great potential for understanding the genetic etiology of disease. This, in turn, could revolut...
164
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
135
click to vote
ALGORITHMICA
2008
15 years 5 months ago
2008
We consider the problem of approximately integrating a Lipschitz function f (with a known Lipschitz constant) over an interval. The goal is to achieve an error of at most using as...