5595 search results - page 123 / 1119 » Approximation Algorithms for Clustering Problems |
129
click to vote
FCT
2007
Springer
15 years 11 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
166
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Cross-layer design and operation of wireless networks has attracted significant interest in the last decade, yet some basic problems in the area remain unsolved. In this paper, w...
156
click to vote
PPSN
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
148
Voted
ITNG
2010
IEEE
15 years 10 months ago
2010
IEEE
— Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or...
140
click to vote
JDCTA
2010
14 years 11 months ago
2010
A novel breadth-first based structural clustering method for graphs is proposed. Clustering is an important task for analyzing complex networks such as biological networks, World ...