A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is
Proceedings Eleventh Annual IEEE International ASIC Conference (Cat. No.98TH8372)
Recent work of Simon and Teng  observes that the recursive bisection (i.e., bipartitioning with equal partition target areas, and minimum possible allowed deviation from targets) heuristic for kway minimum-cut graph partitioning can have unbounded error, but that relaxing the balance constraints in each call to the bipartitioning engine can result in k-way net cuts within a small (Olog k) factor of optimal. Motivated by this result, we experimentally determine whether relaxing thedoi:10.1109/asic.1998.722911 fatcat:c2xbltoj3vas5fvxdidlimyed4