Han Dai, Shi Li 0001, Sijin Peng. On Tight FPT Time Approximation Algorithms for k-Clustering Problems. In Sayan Bhattacharya, Danupon Nanongkai, Michael Benedikt, Gabriele Puppis, editors, 53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, Royal Holloway, University of London, Egham, United Kingdom, July 7-10, 2026. Volume 374 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. [doi]
Abstract is missing.