7930 search results - page 101 / 1586 » Greedy in Approximation Algorithms |
198
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...
159
click to vote
ICPR
2008
IEEE
16 years 21 days ago
2008
IEEE
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
139
click to vote
AAIM
2007
Springer
16 years 14 days ago
2007
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
185
click to vote
EVOW
2005
Springer
15 years 11 months ago
2005
Springer
Computing consensus trees amounts to finding a single tree that summarizes a collection of trees. Three evolutionary algorithms are defined for this problem, featuring characteri...