default search action

combined dblp search
author search
venue search
publication search

ask others

"On bicriterion minimal spanning trees: An approximation."

Kim Allan Andersen, Kurt Jörnsten, Mikael Lind (1996)

> Home

Details and statistics

DOI: 10.1016/S0305-0548(96)00026-3

access: closed

type: Journal Article

metadata version: 2020-02-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cor/AndersenJL96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/AndersenJL96
Kim Allan Andersen, Kurt Jörnsten, Mikael Lind:
On bicriterion minimal spanning trees: An approximation. Comput. Oper. Res. 23(12): 1171-1182 (1996)

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.