"On the k-maximally-disjoint weighted spanning trees problem: variants, ..."

Walid Astaoui, Youcef Magnouche, Sébastien Martin (2025)

> Home

Details and statistics

DOI: 10.1007/S10479-025-06592-X

access: closed

type: Journal Article

metadata version: 2025-08-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/anor/AstaouiMM25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/anor/AstaouiMM25
Walid Astaoui, Youcef Magnouche, Sébastien Martin:
On the k-maximally-disjoint weighted spanning trees problem: variants, complexity and algorithms. Ann. Oper. Res. 351(1): 849-881 (2025)

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.