Judicious partitions of graphs and hypergraphs
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 sev...
| Main Author: | |
|---|---|
| Published: |
Georgia Institute of Technology
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/41064 |