5595 search results - page 128 / 1119 » Approximation Algorithms for Clustering Problems |
146
Voted
IJIS
2007
15 years 4 months ago
2007
Algorithms for clustering web search results have to be efficient and robust. Furthermore they must be able to cluster a dataset without using any kind of a priori information, s...
158
click to vote
ESA
2001
Springer
15 years 9 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
143
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
The Reverse Greedy algorithm (RGREEDY) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the...
172
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
188
click to vote
OL
2011
14 years 11 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...