1279 search results - page 20 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
STOC
2006
ACM
14 years 9 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
AAIM
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...