"On the Computational Complexity and Effectiveness of N-hub Shortest-Path ..."

Reuven Cohen, Gabi Nakibly (2004)

> Home

Details and statistics

DOI: 10.1109/INFCOM.2004.1354540

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/infocom/CohenN04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/infocom/CohenN04
Reuven Cohen, Gabi Nakibly:
On the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing. INFOCOM 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.