External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

On Tight FPT Time Approximation Algorithms for k-Clustering Problems

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]

Authors

Han Dai

This author has not been identified. Look up 'Han Dai' in Google

Shi Li 0001

This author has not been identified. Look up 'Shi Li 0001' in Google

Sijin Peng

This author has not been identified. Look up 'Sijin Peng' in Google
runs on