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

Given an undirected graph G=(V,E,l) with a nonnegative edge length function l, and two integers p, λ, 0<p<|V|, 0≤λ≤ 1, let V^' be a subset of V with |V^'|=p. For each vertex v ∈ V, we let d(v,V^') denote the shortest distance from v to V^'. An eccentricity _C(V^') of V^' denotes the maximum distance of d(v,V^') for all v ∈ V. A median-distance _M(V^') of V^' denotes the total distance of d(v,V^') for all v ∈ V. The p-centdian problem is to find a vertex set V^' of V with |V^'|=p, such that λ_C(V^')+(1-λ) _M(V^') is minimized. The vertex set V^' is called as the centdian set and λ_C(V^')+(1-λ) _M(V^') is called as the centdian-distance. If we converse the two criteria, that is given the bound U of the centdian-distance and the objective function is to minimize the cardinality of the centdian set, this problem is called as the converse centdian problem. In this paper, we prove the p-centdian problem is NP-Complete even when the centdian-distance is _C(V^')+_M(V^'). 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 a (1+ϵ)-approximation (respectively, (1+1/ϵ)(ln|V|+1)-approximation) algorithm for the p-centdian problem (respectively, converse centdian problem) satisfying the cardinality of centdian set is less than or equal to (1+1/ϵ)(ln|V|+1)p (respectively, (1+ϵ)U), in which ϵ>0.

## Authors

• 2 publications
• ### Generalized Liar's Dominating Set in Graphs

In this article, we study generalized liar's dominating set problem in g...
07/26/2019 ∙ by Sangram K. Jena, et al. ∙ 0

• ### Algorithmic Aspects of Semitotal Domination in Graphs

For a graph G=(V,E), a set D ⊆ V is called a semitotal dominating set of...
11/29/2017 ∙ by Michael A. Henning, et al. ∙ 0

• ### P not equal to NP

Let G(V,E) be a graph with vertex set V and edge set E, and let X be eit...
01/30/2018 ∙ by Koko Kalambay Kayibi, et al. ∙ 0

• ### An Efficient Approximation Algorithm for Point Pattern Matching Under Noise

Point pattern matching problems are of fundamental importance in various...
06/07/2005 ∙ by Vicky Choi, et al. ∙ 0

• ### Spanners in randomly weighted graphs: independent edge lengths

Given a connected graph G=(V,E) and a length function ℓ:E→ℝ we let d_v,w...
05/04/2021 ∙ by Alan Frieze, et al. ∙ 0

• ### Maximum Distance Sub-Lattice Problem

In this paper, we define a problem on lattices called the Maximum Distan...
11/07/2018 ∙ by Shashank K Mehta, et al. ∙ 0