Approximability results for the $p$-centdian and the converse centdian problems

TL;DR

This paper proves the NP-Completeness of the $p$-centdian problem, introduces brute-force exact algorithms, and proposes approximation algorithms for both the $p$-centdian and converse centdian problems, addressing their computational complexity and solution approaches.

Contribution

It establishes NP-Completeness for the $p$-centdian problem and provides the first non-trivial exact and approximation algorithms for both problems.

Findings

Proved $p$-centdian problem is NP-Complete.

Developed brute-force exact algorithms for both problems.

Designed approximation algorithms for both problems.

Abstract

Given an undirected graph $G=(V,E)$ with a nonnegative edge length function and an integer $p$, $0 < p < |V|$, the $p$-centdian problem is to find $p$ vertices (called the {\it centdian set}) of $V$ such that the {\it eccentricity} plus {\it median-distance} is minimized, in which the {\it eccentricity} is the maximum (length) distance of all vertices to their nearest {\it centdian set} and the {\it median-distance} is the total (length) distance of all vertices to their nearest {\it centdian set}. The {\it eccentricity} plus {\it median-distance} is called the {\it centdian-distance}. The purpose of the $p$-centdian problem is to find $p$ open facilities (servers) which satisfy the quality-of-service of the minimum total distance ({\it median-distance}) and the maximum distance ({\it eccentricity}) to their service customers, simultaneously. If we converse the two criteria, that is given the bound of the {\it centdian-distance} and the objective function is to minimize the cardinality of the {\it centdian set}, this problem is called the converse centdian problem. In this paper, we prove the $p$-centdian problem is NP-Complete. Then we design the first non-trivial brute force exact algorithms for the $p$-centdian problem and the converse centdian problem, respectively. Finally, we design two approximation algorithms for both problems.