Problems and Results on Judicious Partitions
Abstract
We present a few results and a larger number of questions concerning partitions of graphs or hypergraphs, where the objective is to maximize or minimize several quantities simultaneously. We consider a variety of extremal problems; many of these also have algorithmic counterparts. © 2002 Wiley Periodicals, Inc.
Publication Title
Random Structures and Algorithms
Recommended Citation
Bollobás, B., & Scott, A. (2002). Problems and Results on Judicious Partitions. Random Structures and Algorithms, 21 (3-4), 414-430. https://doi.org/10.1002/rsa.10062
COinS
