  


On the Lovasz Theta Function and Some Variants
Laura Galli (laura.galliunipi.it) Abstract: The Lovasz theta function of a graph is a wellknown upper bound on the stability number. It can be computed efficiently by solving a semidefinite program (SDP). Actually, one can solve either of two SDPs, one due to Lovasz and the other to Groetschel et al. The former SDP is often thought to be preferable computationally, since it has fewer variables and constraints. We derive some new results on these two equivalent SDPs. The surprising result is that, if we weaken the SDPs by aggregating constraints, or strengthen them by adding cutting planes, the equivalence breaks down. In particular, the Groetschel et al. scheme typically yields a stronger bound than the Lovasz one. Keywords: stable set problem, semidefinite programming, Lovasz theta function Category 1: Combinatorial Optimization Category 2: Linear, Cone and Semidefinite Programming (Semidefinite Programming ) Citation: Now published as: L. Galli & A.N. Letchford (2017) On the Lovász theta function and some variants. Discr. Optim., 25, 159174. Download: Entry Submitted: 10/09/2015 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  