View in EDS HTML Full Text PDF Full Text

On the k-maximally-disjoint weighted spanning trees problem: variants, complexity and algorithms.

Saved in:
Bibliographic Details
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.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: aci
DbLabel: Applied Science & Technology Source
An: 187092026
AccessLevel: 2
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: On the k-maximally-disjoint weighted spanning trees problem: variants, complexity and algorithms.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AU" term="%22Astaoui%2C+Walid%22">Astaoui, Walid</searchLink><relatesTo>1</relatesTo>, <i>walid.astaoui@huawei.com</i><br /><searchLink fieldCode="AU" term="%22Magnouche%2C+Youcef%22">Magnouche, Youcef</searchLink><relatesTo>1</relatesTo>, <i>youcef.magnouche@huawei.com</i><br /><searchLink fieldCode="AU" term="%22Martin%2C+Sébastien%22">Martin, Sébastien</searchLink><relatesTo>1</relatesTo>, <i>sebastien.martin@huawei.com</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Annals+of+Operations+Research%22">Annals of Operations Research</searchLink>; Aug2025, Vol. 351 Issue 1, p849-881, 33p
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=aci&AN=187092026
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10479-025-06592-x
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 33
        StartPage: 849
    Titles:
      – TitleFull: On the k-maximally-disjoint weighted spanning trees problem: variants, complexity and algorithms.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Astaoui, Walid
      – PersonEntity:
          Name:
            NameFull: Magnouche, Youcef
      – PersonEntity:
          Name:
            NameFull: Martin, Sébastien
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 08
              Text: Aug2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 02545330
          Numbering:
            – Type: volume
              Value: 351
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Annals of Operations Research
              Type: main
ResultId 1