1647 search results - page 165 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
134
click to vote
FSTTCS
2004
Springer
15 years 10 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
138
click to vote
SISAP
2008
IEEE
15 years 11 months ago
2008
IEEE
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
144
click to vote
EDBT
2004
ACM
16 years 5 months ago
2004
ACM
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
139
click to vote
ASPDAC
1999
ACM
15 years 9 months ago
1999
ACM
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
121
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...