5595 search results - page 99 / 1119 » Approximation Algorithms for Clustering Problems |
202
click to vote
EMMCVPR
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
205
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
208
click to vote
JCO
2010
15 years 5 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
239
click to vote
IPCO
2008
15 years 8 months ago
2008
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
191
click to vote
CJ
1998
15 years 7 months ago
1998
Approximation structuring clustering is an extension of what is usually called square-error clustering" onto various cluster structures and data formats. It appears to be not...