Abstract
Abstract This article considers the inverse 1-median problem on a tree and on a path. The aim is to change the vertex weights at minimum total cost with respect to given modification bounds such that a prespecified vertex becomes 1-median. The inverse 1-median problem on trees with nonnegative weights can be formulated as a continuous knapsack problem and therefore the problem is solvable in O ( n ) -time. For a path with pos/neg weights the 1-median lies on one of the vertices with positive weights or lies on one of the end points. This property leads us to solve the inverse 1-median problem on a path with negative weights (the weight of endpoints are arbitrary) in linear time.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
