"Memoryless routing in convex subdivisions: Random walks are optimal."

Dan Chen et al. (2012)

> Home

Details and statistics

DOI: 10.1016/J.COMGEO.2011.12.005

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/comgeo/ChenDDM12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/comgeo/ChenDDM12
Dan Chen, Luc Devroye, Vida Dujmovic, Pat Morin:
Memoryless routing in convex subdivisions: Random walks are optimal. Comput. Geom. 45(4): 178-185 (2012)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.