Parameterized approximation schemes for clustering with general norm objectives

DOI10.1109/FOCS57990.2023.00085MaRDI QIDQ6942883zbMATH OpenFDO

Authors Roohani Sharma, Fateme Abbasi, Parinya Chalermsook, Dániel Marx, Joachim Spoerhase, Jaroslaw Byrka, Kamyar Khodamoradi, Ameet Gadekar, Sandip Banerjee

Publication date 15 August 2025

Full work available at URL https://eprints.whiterose.ac.uk/201314/8/IEEE_format_submitted_norm_clustering.pdf

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(8)

• Robust scheduling on uniform machines. New results using a relaxed approximation guarantee
• Hybrid k-clustering: blending k-median and k-center
• Parameterized approximation for robust clustering in discrete geometric spaces
• Parameterized inapproximability hypothesis under ETH
• Hybrid k-clustering: blending k-median and k-center
• Dimension-free parameterized approximation schemes for hybrid clustering
• Sampling with a black box: faster parameterized approximation algorithms for vertex deletion problems
• New results on a general class of minimum norm optimization problems

This page was built for publication: Parameterized approximation schemes for clustering with general norm objectives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6942883)