5595 search results - page 29 / 1119 » Approximation Algorithms for Clustering Problems |
153
click to vote
COLT
2008
Springer
15 years 7 months ago
2008
Springer
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...
158
click to vote
SPAA
2010
ACM
15 years 10 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
145
click to vote
APPROX
2000
Springer
15 years 10 months ago
2000
Springer
We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to rj facilities. We give the first non-trivial ap...
157
click to vote
IPL
2011
15 years 26 days ago
2011
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
159
click to vote
ORL
1998
15 years 5 months ago
1998
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...