187 search results - page 1 / 38 » Improved Approximation of MAX-CUT on Graphs of Bounded Degre... |
ECCC
2000
13 years 4 months ago
2000
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
JDA
2008
13 years 4 months ago
2008
The best approximation algorithm for Max Cut in graphs of maximum degree 3 uses semidefinite programming, has approximation ratio 0.9326, and its running time is (n3.5 log n) ; bu...
ICTCS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most...
SWAT
1994
Springer
13 years 8 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
STACS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...