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...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1059; p. 115605
Main Authors:	Liu, Shuilian, Chen, Xianrun, Xu, Yicheng
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 04.01.2026
Subjects:	[formula omitted]-supplier problem Capacitated clustering Fixed-parameter tractable Capacitated clustering k-supplier problem Fixed-parameter tractable
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!