7930 search results - page 253 / 1586 » Greedy in Approximation Algorithms |
161
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
163
click to vote
ESA
2007
Springer
16 years 22 days ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
171
click to vote
ICIP
1999
IEEE
16 years 8 months ago
1999
IEEE
This paper presents an iterative algorithm for approximating gray-scale images with adaptive triangular meshes ensuring a given tolerance. At each iteration, the algorithm applies...
169
click to vote
ISSAC
2004
Springer
15 years 12 months ago
2004
Springer
This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) of multivariate polynomials whose coefficients may be inexact. ...
166
click to vote
SODA
1997
ACM
15 years 8 months ago
1997
ACM
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...