Abstract

In this paper, we consider an inverse model for the least uniform spanning tree (ILUS) problems. Let T be a spanning tree of a network G. Define the degree of balance of T as the difference between the maximum and the minimum weight of the edges in T. (ILUS) problem can be described as: how to change the weight vector w of G under a given budget constraint so that the maximum degree of balance of the spanning trees of G is minimized. After discussing some characteristics of (ILUS) problem, we show that this problem can be solved efficiently by strongly polynomial algorithm.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.