Sciweavers

COMBINATORICA
2006
65views more  COMBINATORICA 2006»
13 years 4 months ago
A Linear Bound On The Diameter Of The Transportation Polytope
We prove that the combinatorial diameter of the skeleton of the polytope of feasible solutions of any m
Graham Brightwell, Jan van den Heuvel, Leen Stougi...
DAC
2005
ACM
13 years 6 months ago
Faster and better global placement by a new transportation algorithm
We present BonnPlace, a new VLSI placement algorithm that combines the advantages of analytical and partitioning-based placers. Based on (non-disjoint) placements minimizing the t...
Ulrich Brenner, Markus Struzyna