5595 search results - page 184 / 1119 » Approximation Algorithms for Clustering Problems |
151
click to vote
DAM
2008
15 years 6 months ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
129
click to vote
APPROX
2007
Springer
16 years 6 days ago
2007
Springer
Abstract. We consider the problem of approximating the average distance between pairs of points in a high-dimensional Euclidean space, and more generally in any metric space. We co...
152
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
143
click to vote
FLAIRS
2001
15 years 7 months ago
2001
As organizations accumulate data over time, the problem of tracking how patterns evolve becomes important. In this paper, we present an algorithm to track the evolution of cluster...
131
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...