Abstract
This paper addresses the problem of modifying the vertex weights of a block graph at minimum total cost so that a prespecified vertex becomes a 1-median of the perturbed graph. We call this problem the inverse 1-median problem on block graphs with variable vertex weights. For block graphs with equal edge lengths in each block, we can formulate the problem as a univariate optimization problem. By the convexity of the objective function, the local optimizer is also the global one. Therefore, we use the convexity to develop an $$O(M\log M)$$O(MlogM) algorithm that solves the problem on block graphs with M vertices.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.