5595 search results - page 64 / 1119 » Approximation Algorithms for Clustering Problems |
120
click to vote
IPL
2007
15 years 4 months ago
2007
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
128
Voted
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
137
Voted
ICDM
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper we address the problem of combining multiple clusterings without access to the underlying features of the data. This process is known in the literature as clustering...
133
Voted
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
175
click to vote
PODC
2009
ACM
16 years 5 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...