Computing an obnoxious anchored segment

Computing an obnoxious anchored segment

0.00 Avg rating—0 Votes
Article ID: iaor20032676
Country: Netherlands
Volume: 31
Issue: 4
Start Page Number: 293
End Page Number: 300
Publication Date: Jul 2003
Journal: Operations Research Letters
Authors: , , ,
Keywords: facilities, combinatorial analysis
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.

Reviews

Required fields are marked *. Your email address will not be published.