1389 search results - page 107 / 278 » Improved Approximation Algorithms for Label Cover Problems |
147
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— The paper investigates theoretical issues in applying the universal swarming technique to efficient content distribution. In a swarming session, a file is distributed...
162
click to vote
STOC
2002
ACM
16 years 5 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
176
Voted
SODA
2010
ACM
15 years 2 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
153
click to vote
SIGMOD
2008
ACM
15 years 4 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
138
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...