1647 search results - page 102 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
134
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We show how to compute the edit distance between two strings of length n up to a factor of 2 ~O( log n) in n1+o(1) time. This is the first sub-polynomial approximation algorithm f...
156
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
163
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...
164
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
158
click to vote
BMCBI
2007
15 years 5 months ago
2007
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...