"On the complexity of the bilevel minimum spanning tree problem."

Christoph Buchheim, Dorothee Henke, Felix Hommelsheim (2022)

> Home

Details and statistics

DOI: 10.1002/NET.22111

access: open

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/networks/BuchheimHH22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/BuchheimHH22
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim:
On the complexity of the bilevel minimum spanning tree problem. Networks 80(3): 338-355 (2022)

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.