7006 search results - page 59 / 1402 » Approximation Algorithms |
ORL
2007
14 years 11 months ago
2007
We present a very simple way of derandomizing the algorithm proposed by Gupta, Kumar and Roughgarden for Single Source Rent-or-Buy by using the method of conditional expectation. ...
109
click to vote
FOCS
2005
IEEE
15 years 5 months ago
2005
IEEE
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
IJCGA
2002
14 years 11 months ago
2002
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
100
click to vote
PR
1998
14 years 11 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...