7150 search results - page 210 / 1430 » An Approximation Algorithm for Approximation Rank |
136
click to vote
STOC
2002
ACM
16 years 6 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...
195
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
160
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
204
click to vote
TAMC
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
127
click to vote
ISSAC
2005
Springer
16 years 1 days ago
2005
Springer
In this article we propose a new symbolic-numeric algorithm to find positive equilibria of a n-dimensional dynamical system. This algorithm uses a symbolic manipulation of ODE in...