Sciweavers

SODA
2003
ACM
115views Algorithms» more  SODA 2003»
13 years 5 months ago
Random walks on the vertices of transportation polytopes with constant number of sources
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...
Mary Cryan, Martin E. Dyer, Haiko Müller, Lee...