"On the computational complexity and effectiveness of N-hub shortest-path ..."

Reuven Cohen, Gabi Nakibly (2008)

> Home

Details and statistics

DOI: 10.1145/1399562.1399578

access: closed

type: Journal Article

metadata version: 2008-08-05

- view
  - electronic edition @ acm.org
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ton/CohenN08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ton/CohenN08
Reuven Cohen, Gabi Nakibly:
On the computational complexity and effectiveness of N-hub shortest-path routing. IEEE/ACM Trans. Netw. 16(3): 691-704 (2008)

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.