1279 search results - page 53 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
152
Voted
INFOCOM
2010
IEEE
15 years 21 days ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
137
click to vote
CALC
2001
Springer
15 years 6 months ago
2001
Springer
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
133
click to vote
APPROX
2011
Springer
14 years 2 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
118
click to vote
TAMC
2007
Springer
15 years 8 months ago
2007
Springer
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...