These days, autonomous vehicles (AVs) technology has been improved dramatically.
However, even though the AVs require no human intervention in most situations, AVs may …

This paper studies the constrained version of the k-center location problem. Given a convex
polygonal region, every point in the region originates a service demand. Our objective is to …

In this paper we study several instances of the aligned k-center problem where the goal is,
given a set of points S in the plane and a parameter k⩾ 1, to find k disks with centers on a …

Given a line segment arrangement, defined as the geometric structure induced by a set of n
line segments in a plane, we study the complexity of two covering problems—Cell Cover for …

In this paper we consider several instances of the k-center on a line problem where the goal
is, given a set of points S in the plane and a parameter k>= 1, to find k disks with centers on …

We consider the planar two-center problem for a convex polygon: given a convex polygon in
the plane, find two congruent disks of minimum radius whose union contains the polygon …

We provide the solution for a fundamental problem of geometric optimization by giving a
complete characterization of worst-case optimal disk coverings of rectangles: For any λ≥ 1 …

This paper studies an incremental version of the k-center problem with centers constrained
to lie on boundary of a convex polygon. In the incremental k-center problem we considered …

This paper discusses the problem of covering and hitting a set of line segments L in R 2 by a
pair of axis-parallel congruent squares of minimum size. We also discuss the restricted …

We study a generalization of $ k $-center clustering, first introduced by Kavand et. al., where
instead of one set of centers, we have two types of centers, $ p $ red and $ q $ blue, and …