A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
FPT Approximation for Constrained Metric k-Median/Means
[article]

2020
*
arXiv
*
pre-print

The Metric k-median problem over a metric space (X, d) is defined as follows: given a set L ⊆X of facility locations and a set C ⊆X of clients, open a set F ⊆ L of k facilities such that the total service cost, defined as Φ(F, C) ≡∑_x ∈ Cmin_f ∈ F d(x, f), is minimised. The metric k-means problem is defined similarly using squared distances. In many applications there are additional constraints that any solution needs to satisfy. This gives rise to different constrained versions of the problem

arXiv:2007.11773v1
fatcat:josqnidnabaytcmgdf2wuav2rm