"Optimal oblivious routing in polynomial time."

Yossi Azar et al. (2004)

> Home

Details and statistics

DOI: 10.1016/J.JCSS.2004.04.010

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/AzarCFKR04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/AzarCFKR04
Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke:
Optimal oblivious routing in polynomial time. J. Comput. Syst. Sci. 69(3): 383-394 (2004)

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.