"Complexity results on labeled shortest path problems from wireless routing ..."

Charles B. Ward, Nathan M. Wiegand (2010)

> Home

Details and statistics

DOI: 10.1016/J.COMNET.2009.04.012

access: closed

type: Journal Article

metadata version: 2020-02-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cn/WardW10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cn/WardW10
Charles B. Ward, Nathan M. Wiegand:
Complexity results on labeled shortest path problems from wireless routing metrics. Comput. Networks 54(2): 208-217 (2010)

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.