1279 search results - page 25 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
134
click to vote
WADS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...
139
click to vote
CATS
2006
15 years 3 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
AI
2005
Springer
15 years 1 months ago
2005
Springer
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
238
click to vote
IACR
2011
14 years 1 months ago
2011
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
127
click to vote
SIAMCOMP
1998
15 years 1 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...