Sciweavers

Share
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
8 years 5 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are uniļ¬ed into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
books