FPT Approximation for Constrained Metric k-Median/Means

Abstract

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 ∈ C} Min_{f ∈ F} D(x, F), Is Minimised. The Metric K-means Problem Is Defined Similarly Using Squared Distances (i.e., D²(., .) Instead Of D(., .)). In Many Applications There Are Additional Constraints That Any Solution Needs To Satisfy. For Example, To Balance The Load Among The Facilities In Resource Allocation Problems, A Capacity U Is Imposed On Every Facility. That Is, No More Than U Clients Can Be Assigned To Any Facility. This Problem Is Known As The Capacitated K-means/k-median Problem. Likewise, Various Other Applications Have Different Constraints, Which Give Rise To Different Constrained Versions Of The Problem Such As R-gather, Fault-tolerant, Outlier K-means/k-median Problem. Surprisingly, For Many Of These Constrained Problems, No Constant-approximation Algorithm Is Known. Moreover, The Unconstrained Problem Itself Is Known [marek Adamczyk Et Al., 2019] To Be W[2]-hard When Parameterized By K. We Give Fpt Algorithms With Constant Approximation Guarantee For A Range Of Constrained K-median/means Problems. For Some Of The Constrained Problems, Ours Is The First Constant Factor Approximation Algorithm Whereas For Others, We Improve Or Match The Approximation Guarantee Of Previous Works. We Work Within The Unified Framework Of Ding And Xu [ding And Xu, 2015] That Allows Us To Simultaneously Obtain Algorithms For A Range Of Constrained Problems. In Particular, We Obtain A (3+ε)-approximation And (9+ε)-approximation For The Constrained Versions Of The K-median And K-means Problem Respectively In Fpt Time. In Many Practical Settings Of The K-median/means Problem, One Is Allowed To Open A Facility At Any Client Location, I.e., C ⊆ L. For This Special Case, Our Algorithm Gives A (2+ε)-approximation And (4+ε)-approximation For The Constrained Versions Of K-median And K-means Problem Respectively In Fpt Time. Since Our Algorithm Is Based On Simple Sampling Technique, It Can Also Be Converted To A Constant-pass Log-space Streaming Algorithm. In Particular, Here Are Some Of The Main Highlights Of This Work: 1) For The Uniform Capacitated K-median/means Problems Our Results Matches Previously Known Results Of Addad Et Al. [vincent Cohen-addad And Jason Li, 2019]. 2) For The R-gather K-median/means Problem (clustering With Lower Bound On The Size Of Clusters), Our Fpt Approximation Bounds Are Better Than What Was Previously Known. 3) Our Approximation Bounds For The Fault-tolerant, Outlier, And Uncertain Versions Is Better Than All Previously Known Results, Albeit In Fpt Time. 4) For Certain Constrained Settings Such As Chromatic, L-diversity, And Semi-supervised K-median/means, We Obtain The First Constant Factor Approximation Algorithms To The Best Of Our Knowledge. 5) Since Our Algorithms Are Based On A Simple Sampling Based Approach, We Also Obtain Constant-pass Log-space Streaming Algorithms For Most Of The Above-mentioned Problems.