D. Karger, R. Motwani, M. Sudan, "Approximate GRAPH COLOURING by Semidefinite Programming", 35th IEEE Symposium on Foundations of Computer Science, Santa Fe, pp. 1--10, October 1994.  Home/Search   Document Not in Database   Summary   Related Articles

....the MAX CUT problem with an approximation ratio of 0:878. The previously best known approximation ratio for MAX CUT was 0:5. Subsequently, semidefinite programming based techniques have led to randomized algorithms with substantially better approximation ratios for a number of fundamental problems [12, 16, 7, 9, 2]. In all above applications of SP, the authors also studied the limitations of the SP approach, and showed that the particular SP formulations that they use do not in fact give approximation ratios that are significantly better than those proved. See also [6] All the new developments mentioned ....

D. Karger, R. Motwani, M. Sudan, "Approximate GRAPH COLOURING by Semidefinite Programming", 35th IEEE Symposium on Foundations of Computer Science, Santa Fe, pp. 1--10, October 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC