Location of Repository

On semidefinite programming bounds for graph bandwidth

By Etienne De Klerk, Marianna E.-Nagy and Renata Sotirov

Abstract

We propose two new lower bounds on graph bandwidth and cyclic bandwidth based on semidefinite programming (SDP) relaxations of the quadratic assignment problem. We compare the new bounds with two other SDP bounds in [A. Blum, G. Konjevod, R. Ravi, and S. Vempala, Semi-definite relaxations for minimum bandwidth and other vertex-orderin

Topics: Graph bandwidth, cyclic bandwidth, semidefinite programming, quadratic assignment
Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.416.5926
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.optimization-online... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.