首页 | 本学科首页   官方微博 | 高级检索  
     


Connections between semidefinite relaxations of the max-cut and stable set problems
Authors:Monique Laurent  Svatopluk Poljak  Franz Rendl
Affiliation:1. LIENS - Ecole Normale Supérieure, 45 rue d’Ulm, 75230, Paris cedex 05, France
2. Fakult?t für Mathematik und Informatik, Universit?t Passau, Innstrasse 33, 94030, Passau, Germany
3. Technische Universit?t Graz, Institut für Mathematik, Kopernikusgasse 24, A-8010, Graz, Austria
Abstract:We describe links between a recently introduced semidefinite relaxation for the max-cut problem and the well known semidefinite relaxation for the stable set problem underlying the Lovász’s theta function. It turns out that the connection between the convex bodies defining the semidefinite relaxations mimics the connection existing between the corresponding polyhedra. We also show how the semidefinite relaxations can be combined with the classical linear relaxations in order to obtain tighter relaxations. This work was done while the author visited CWI, Amsterdam, The Netherlands. Svata Poljak untimely deceased in April 1995. We shall both miss Svata very much. Svata was an excellent colleague, from whom we learned a lot of mathematics and with whom working was always a very enjoyable experience; above all, Svata was a very nice person and a close friend of us. The research was partly done while the author visited CWI, Amsterdam, in October 1994 with a grant fom the Stieltjes Institute, whose support is gratefully acknowledged. Partially supported also by GACR 0519. Research support by Christian Doppler Laboratorium für Diskrete Optimierung.
Keywords:Max-cut problem  Stable set problem  Semidefinite relaxations
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号