On the k-maximally-disjoint weighted spanning trees problem: variants, complexity and algorithms.
Saved in:
| Title: | On the k-maximally-disjoint weighted spanning trees problem: variants, complexity and algorithms. |
|---|---|
| Authors: | Astaoui, Walid1, walid.astaoui@huawei.com, Magnouche, Youcef1, youcef.magnouche@huawei.com, Martin, Sébastien1, sebastien.martin@huawei.com |
| Source: | Annals of Operations Research; Aug2025, Vol. 351 Issue 1, p849-881, 33p |
| Database: | Applied Science & Technology Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| ISSN: | 02545330 |
|---|---|
| DOI: | 10.1007/s10479-025-06592-x |
