The Distance-Constrained Matroid Median Problem

Research output: Contribution to journalArticlepeer-review

Abstract

Alamdari and Shmoys introduced the following variant of the k-median problem. In this variant, we are given an instance of the k-median problem and a threshold value. Then this variant is the same as the k-median problem except that if the distance between a client i and a facility j is more than the threshold value, then i is not allowed to be connected to j. In this paper, we consider a matroid generalization of this variant of the k-median problem. First, we introduce a generalization of this variant in which the constraint on the number of opened facilities is replaced by a matroid constraint. Then we propose a polynomial-time bicriteria approximation algorithm for this problem by combining the algorithm of Alamdari and Shmoys and the algorithm of Krishnaswamy, Kumar, Nagarajan, Sabharwal, and Saha for a matroid generalization of the k-median problem.

Original languageEnglish
Pages (from-to)2087-2106
Number of pages20
JournalAlgorithmica
Volume82
Issue number7
DOIs
Publication statusPublished - Jul 1 2020

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Computer Science Applications
  • Applied Mathematics

Fingerprint Dive into the research topics of 'The Distance-Constrained Matroid Median Problem'. Together they form a unique fingerprint.

Cite this