1647 search results - page 80 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
123
click to vote
ICCS
2009
Springer
15 years 11 months ago
2009
Springer
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...
133
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
268
click to vote
ICDE
2008
IEEE
16 years 6 months ago
2008
IEEE
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
136
click to vote
WAE
2000
15 years 6 months ago
2000
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...
154
Voted
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...