Assigning Weights to Minimize the Covering Radius in the Plane

04/01/2018
by   Eunjin Oh, et al.
0

Given a set P of n points in the plane and a multiset W of k weights with k≤ n, we assign each weight in W to a distinct point in P to minimize the maximum weighted distance from the weighted center of P to any point in P. In this paper, we give two algorithms which take O(k^2n^2^3 n) time and O(k^5n^3k+kn^3 n) time, respectively. For a constant k, the second algorithm takes only O(n^3n) time, which is near linear.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/01/2019

Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points

We consider a bichromatic two-center problem for pairs of points. Given ...
research
05/15/2023

Geometric Hitting Set for Line-Constrained Disks and Related Problems

Given a set P of n weighted points and a set S of m disks in the plane, ...
research
09/27/2021

Clustering with Neighborhoods

In the standard planar k-center clustering problem, one is given a set P...
research
07/07/2023

Line-Constrained k-Semi-Obnoxious Facility Location

Suppose we are given a set B of blue points and a set R of red points, a...
research
12/13/2019

Construction and Maintenance of Swarm Drones

In this paper we study the dynamic version of the covering problem motiv...
research
12/31/2020

Faster Distance-Based Representative Skyline and k-Center Along Pareto Front in the Plane

We consider the problem of computing the distance-based representative s...
research
05/07/2018

Capturing points with a rotating polygon (and a 3D extension)

We study the problem of rotating a simple polygon to contain the maximum...

Please sign up or login with your details

Forgot password? Click here to reset