"An Optimal Time Bound for Oblivious Routing."

Ian Parberry (1990)

> Home

Details and statistics

DOI: 10.1007/BF01840387

access: closed

type: Journal Article

metadata version: 2017-06-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/Parberry90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/Parberry90
Ian Parberry:
An Optimal Time Bound for Oblivious Routing. Algorithmica 5(2): 243-250 (1990)

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.