scientific article; zbMATH DE number 4003525

From MaRDI portal
Publication:4728245





[For the entire collection see Zbl 0596.00021.] In this paper we discuss a collection of geometric location problems in the plane and their associated time complexity. These problems can be formulated as optimization problems. However, geometric properties are exploited to obtain efficient solutions. Among the problems considered are minimum enclosing circle, largest empty circle, fixed circle placement, and their variations. Most of the algorithms mentioned are asymptotically optimal to within a constant factor under the algebraic computation tree model. Finally, a geometric competitive location problem is discussed and some open problems suggested.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4728245)