7129 search results - page 33 / 1426 » Approximation Algorithms for Treewidth |
196
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...
125
Voted
ICIP
1998
IEEE
16 years 7 months ago
1998
IEEE
159
click to vote
ICPR
2008
IEEE
16 years 20 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 ...
137
click to vote
AAIM
2007
Springer
16 years 13 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...
161
Voted
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.82...