| Article ID: | iaor20014130 |
| Country: | United States |
| Volume: | 27 |
| Issue: | 3 |
| Start Page Number: | 175 |
| End Page Number: | 181 |
| Publication Date: | May 1996 |
| Journal: | Networks |
| Authors: | Labb Martine, DellAmico Mauro, Maffioli Francesco |
| Keywords: | networks |
We consider the problem of finding an optimal spanning tree with respect to objective functions which depend on the set of leaves of the tree. We address 18 different such problems and determine their computational complexity. Only a few of the problems examined have been given attention in the existing literature.