Abstract
This column is devoted to geometric clustering and covering problems in Rd. As exact solutions for these problems are usually out of reach (unless d = 1), one is forced to deal with approximations. Here we mostly consider online algorithms, as the online setting introduces additional difficulty due to uncertainty about the future. One representative problem is the following (so-called Unit Covering): given a set of n points in Rd, cover the points by balls of unit diameter, so as to minimize the number of balls used.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
