7006 search results - page 184 / 1402 » Approximation Algorithms |
131
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
134
click to vote
MP
1998
15 years 2 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
ARITH
2007
IEEE
15 years 9 months ago
2007
IEEE
In the present paper, we investigate the approximation of a function by a polynomial with floating-point coefficients; we are looking for the best approximation in the L2 sense....
143
click to vote
RECOMB
2000
Springer
15 years 6 months ago
2000
Springer
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for...
111
click to vote
WG
2001
Springer
15 years 7 months ago
2001
Springer
There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs [3], but the large exponent makes this algorithm impractical. In this paper, we give an alg...