Abstract
In this paper we address a maximin facility location problem for n points in the plane such that the facility is an anchored line segment of a fixed length. We show how to solve this problem in O(n log n) time, which is optimal in the algebraic computation tree model. Other variations of this problem are also discussed.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
