Title:
Judicious partitions of graphs and hypergraphs

Thumbnail Image
Author(s)
Ma, Jie
Authors
Advisor(s)
Yu, Xingxing
Advisor(s)
Person
Editor(s)
Associated Organization(s)
Organizational Unit
Organizational Unit
Supplementary to
Abstract
Classical partitioning problems, like the Max-Cut problem, ask for partitions that optimize one quantity, which are important to such fields as VLSI design, combinatorial optimization, and computer science. Judicious partitioning problems on graphs or hypergraphs ask for partitions that optimize several quantities simultaneously. In this dissertation, we work on judicious partitions of graphs and hypergraphs, and solve or asymptotically solve several open problems of Bollobas and Scott on judicious partitions, using the probabilistic method and extremal techniques.
Sponsor
Date Issued
2011-05-04
Extent
Resource Type
Text
Resource Subtype
Dissertation
Rights Statement
Rights URI