5595 search results - page 104 / 1119 » Approximation Algorithms for Clustering Problems |
152
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
161
click to vote
NIPS
2001
15 years 6 months ago
2001
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
149
click to vote
DISOPT
2006
15 years 4 months ago
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
134
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
K-means is a widely used partitional clustering method. While there are considerable research efforts to characterize the key features of K-means clustering, further investigation...
132
click to vote
SODA
2003
ACM
15 years 6 months ago
2003
ACM
We consider a fault-tolerant generalization of the classical uncapacitated facility location problem, where each client j has a requirement that rj distinct facilities serve it, i...