UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Eigenvalue, Quadratic Programming and Semidefinite Programming Bounds for Graph Partitioning Problems

Thumbnail Image

Files

Wang_Ningchuan.pdf (491.36 KB)

Date

2014-09-03

Authors

Wang, Ningchuan

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

The Graph Partitioning problems are hard combinatorial optimization problems. We are interested in both lower bounds and upper bounds. We introduce several methods including basic eigenvalue and projected eigenvalue techniques, convex quadratic programming techniques, and semidefinite programming (SDP). In particular, we show that the SDP relaxation is equivalent to and arises from the Lagrangian relaxation for a particular quadratically constrained quadratic model. Moreover, the bounds obtained by the eigenvalue techniques are good and cheap.

Description

Keywords

Graph Partitioning, Semidefinite Programming, eigenvalue bounds

LC Keywords

Citation

URI

http://hdl.handle.net/10012/8760

Collections

Theses
Combinatorics and Optimization