"The 2-hop spanning tree problem."

Geir Dahl (1998)

> Home

Details and statistics

DOI: 10.1016/S0167-6377(98)00029-7

access: closed

type: Journal Article

metadata version: 2020-03-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/orl/Dahl98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/Dahl98
Geir Dahl:
The 2-hop spanning tree problem. Oper. Res. Lett. 23(1-2): 21-26 (1998)

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.