Open AccessArticle
Complexity of Spanning Tree Problems with Leaf-Dependant Objective Function
Mauro Dell’Amico,Martine Labbé,Francesco Maffioli-1996-01-01-IRIS UNIMORE (University of Modena and Reggio Emilia)
0
TL;DRAbstract
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.
Chat with Paper
AI Agents for this Paper
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.
Keywords
Tree (set theory)Spanning treeMathematicsFunction (biology)Computer scienceCombinatoricsBiology
Chat
Click to start Chat