A fixed-parameter tractable approximation for capacitated k-supplier

•We study the uniform-capacitatedk-supplier problem with distinct facility and client sets.•The objective is to minimize the maximum distance between any client and its assigned facility under capacity and cardinality constraints.•We propose the first randomized FPT algorithm for this problem, achie...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 1059; s. 115605
Hlavní autoři: Liu, Shuilian, Chen, Xianrun, Xu, Yicheng
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 04.01.2026
Témata:
[formula omitted]-supplier problem
Capacitated clustering
Fixed-parameter tractable
Capacitated clustering
k-supplier problem
Fixed-parameter tractable
ISSN:0304-3975
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•We study the uniform-capacitatedk-supplier problem with distinct facility and client sets.•The objective is to minimize the maximum distance between any client and its assigned facility under capacity and cardinality constraints.•We propose the first randomized FPT algorithm for this problem, achieving a 5-approximation.•Our result opens a new algorithmic direction by addressing the problem from a parameterized perspective. Capacitated clustering is a fundamental problem in combinatorial optimization with applications in network design and facility location. While most existing results, such as k-center and sum of radii problems, assume that clients and facilities are co-located, real-world scenarios often involve distinct sets of clients and facility locations. To bridge this discrepancy, we study the uniform-capacitated k-supplier problem, where the facility set and client set are separate. The objective is to minimize the maximum distance between any client and its assigned facility, subject to opening at most k facilities, each of which can serve up to U clients, where U is a uniform capacity bound. The best known result is an 11-approximation algorithm for the non-uniform version in polynomial time. We focus on the uniform case and present the first randomized FPT (fixed-parameter tractable) algorithm achieving a 5-approximation, with running time exponential in k.
ISSN:0304-3975
DOI:10.1016/j.tcs.2025.115605