On semidefinite programming relaxations of maximum k -section

We derive a new semidefinite programming bound for the maximum k -section problem. For k=2 (i.e. for maximum bisection), the new bound is at least as strong as a well-known bound by Poljak and Rendl (SIAM J Optim 5(3):467–487, 1995). For k≥3 the new bound dominates a bound of Karisch and Rendl...

Full description

Saved in:
Bibliographic Details
Main Authors: Klerk, Etienne de., Pasechnik, Dmitrii V., Sotirov, Renata., Dobre, Cristian.
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2013
Subjects:
Online Access:https://hdl.handle.net/10356/97683
http://hdl.handle.net/10220/11138
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English