7930 search results - page 159 / 1586 » Greedy in Approximation Algorithms |
186
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
218
click to vote
TIFS
2008
15 years 6 months ago
2008
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
260
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
174
click to vote
WWW
2008
ACM
16 years 7 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....