3875 search results - page 426 / 775 » Approximation algorithms for the 0-extension problem |
196
click to vote
STACS
2007
Springer
16 years 26 days ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
215
click to vote
MOBICOM
2006
ACM
16 years 22 days ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
183
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
190
click to vote
NIPS
2007
15 years 8 months ago
2007
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
176
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...