We consider the problem of finding an optimal spanning tree with respect toobjective functions which depend on the set of leaves of the tree. Weaddress 18 different such problems and determine their computational complexity.Only few of the problems examined have been given attention in theexisting literature.

Complexity of Spanning Tree Problems with Leaf-Dependant Objective Function / Dell'Amico, Mauro; Labbe', M.; Maffioli, F.. - In: NETWORKS. - ISSN 0028-3045. - STAMPA. - 27:(1996), pp. 175-181.

Complexity of Spanning Tree Problems with Leaf-Dependant Objective Function

DELL'AMICO, Mauro;
1996

Abstract

We consider the problem of finding an optimal spanning tree with respect toobjective functions which depend on the set of leaves of the tree. Weaddress 18 different such problems and determine their computational complexity.Only few of the problems examined have been given attention in theexisting literature.
27
175
181
Complexity of Spanning Tree Problems with Leaf-Dependant Objective Function / Dell'Amico, Mauro; Labbe', M.; Maffioli, F.. - In: NETWORKS. - ISSN 0028-3045. - STAMPA. - 27:(1996), pp. 175-181.
Dell'Amico, Mauro; Labbe', M.; Maffioli, F.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11380/451179
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? ND
social impact