Abstract
Abstract We investigate the inverse 1-center location problem on trees and outline combinatorial algorithms with time complexity O ( n 2 ) in case that the topology of the tree does not change. In the uniform cost model an improved running time of O ( n log n ) can be obtained. If topology changes occur, the complexity increases by a factor bounded by n . This improves earlier results of Yang and Zhang.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
