Electronic Theses and Dissertations

Date

2022

Document Type

Thesis

Degree Name

Master of Science

Department

Computer Science

Committee Chair

Nirman Kumar

Committee Member

Thomas Watson

Committee Member

Deepak Venugopal

Abstract

The k-center problem is a well-known geometric location problem, where we are given a set P of n points in a metric space and a positive integer k, and the task is to find k balls of minimum radius whose union covers P. 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 where each red center is at least α distant from each blue center. The goal is to minimize the covering radius. We provide an approximation algorithm for this problem, and a polynomial time algorithm for the constrained problem, where all the centers must lie on a line ℓ.

Comments

Data is provided by the student.

Library Comment

Dissertation or thesis originally submitted to ProQuest.

Notes

Open access

Download

Share

COinS