5595 search results - page 23 / 1119 » Approximation Algorithms for Clustering Problems |
119
click to vote
IPCO
2004
15 years 1 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
128
click to vote
FOCS
2010
IEEE
14 years 9 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
ESA
2008
Springer
15 years 1 months ago
2008
Springer
SODA
1997
ACM
15 years 1 months ago
1997
ACM
