Article ID: | iaor19982372 |
Country: | Netherlands |
Volume: | 89 |
Issue: | 2 |
Start Page Number: | 423 |
End Page Number: | 426 |
Publication Date: | Mar 1996 |
Journal: | European Journal of Operational Research |
Authors: | Nair K.P.K., Punnen Abraham P. |
Keywords: | complexity |
In a graph in which each edge has two weights, the max + sum spanning tree problem seeks a spanning tree that has the minimum value for the combined total of the maximum of one of the edge weights and the sum of the other weights among all the spanning trees in the graph. Exploiting an efficient data structure, an O(