2137 search results - page 213 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
176
Voted
WWW
2010
ACM
16 years 1 months ago
2010
ACM
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
193
click to vote
JCO
1998
15 years 6 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
189
click to vote
STACS
2007
Springer
16 years 17 days ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
159
Voted
OPODIS
2008
15 years 7 months ago
2008
Abstract. We consider the following model of cellular networks. Each base station has a given finite capacity, and each client has some demand and profit. A client can be covered b...
154
click to vote
ANOR
2008
15 years 6 months ago
2008
We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those obj...