The Non-Uniform k -Center Problem

DOI10.1145/3392720OpenAlexW2964242853MaRDI QIDQ5888937

Ravishankar Krishnaswamy, Prachi Goyal, Deeparnab Chakrabarty

Publication date: 26 April 2023

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3392720

zbMATH Keywords

outliersclustering algorithmsfirefighting on trees

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (5)

Fully dynamic clustering and diversity maximization in doubling metrics ⋮ Graph burning and non-uniform \(k\)-centers for small treewidth ⋮ Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier ⋮ Robust \(k\)-center with two types of radii ⋮ On perturbation resilience of non-uniform \(k\)-center

This page was built for publication: The Non-Uniform k -Center Problem