Abstract
In this paper we consider the pos/neg weighted 1-median problem on block graphs where the customers are modeled as subgraphs. Under the condition that the block graph has unit edge lengths and the median is restricted to the vertex of the block graph, we devise a linear time algorithm for this problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have