Conference paper
Global routing revisited
Michael D. Moffitt
ICCAD 2009
The random simplex algorithm for linear programming proceeds as follows: at each step, it moves from a vertex v of the polytope to a randomly chosen neighbor of v, the random choice being made from those neighbors of v that improve the objective function. We exhibit a polytope defined by n constraints in three dimensions with height O(log n), for which the expected running time of the random simplex algorithm is Ω( n log n). © 1995.
Michael D. Moffitt
ICCAD 2009
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007