Memoryless routing in convex subdivisions: Random walks are optimal

Dan Chen, Luc Devroye, Vida Dujmovic, Pat Morin. Memoryless routing in convex subdivisions: Random walks are optimal. Comput. Geom., 45(4):178-185, 2012. [doi]

Authors

Dan Chen

This author has not been identified. Look up 'Dan Chen' in Google

Luc Devroye

This author has not been identified. Look up 'Luc Devroye' in Google

Vida Dujmovic

This author has not been identified. Look up 'Vida Dujmovic' in Google

Pat Morin

This author has not been identified. Look up 'Pat Morin' in Google