7129 search results - page 33 / 1426 » Approximation Algorithms for Treewidth |
APPROX
2004
Springer
15 years 3 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...
ICIP
1998
IEEE
15 years 11 months ago
1998
IEEE
ICPR
2008
IEEE
15 years 4 months 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 ...
AAIM
2007
Springer
15 years 3 months 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...
WAOA
2005
Springer
15 years 3 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...