Graph Partitioning and Semi-definite Programming Hierarchies
Graph partitioning is a fundamental optimization problem that has been intensively studied. Many graph partitioning formulations are important as building blocks for divide-and-conquer algorithms on graphs as well as to many applications such as VLSI layout, packet routing in distributed networks, c...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Research Showcase @ CMU
2012
|
| Subjects: | |
| Online Access: | http://repository.cmu.edu/dissertations/145 http://repository.cmu.edu/cgi/viewcontent.cgi?article=1143&context=dissertations |