The Non-Uniform k -Center Problem

DOI10.1145/3392720MaRDI QIDQ5888937zbMATH OpenOpenAlexFDO

Authors Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy

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

clustering algorithmsfirefighting on treesoutliers

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• The non-uniform k-center problem
• On perturbation resilience of non-uniform k-center
• Robust \(k\)-center with two types of radii
• Robust \(k\)-center with two types of radii
• Approximating k-center in planar graphs

Cited in

(20)

• On the k-center problem with many centers
• On perturbation resilience of non-uniform k-center
• Tight FPT approximation for constrained k-center and k-supplier
• THE ALIGNED K-CENTER PROBLEM
• The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension
• Robust \(k\)-center with two types of radii
• New algorithms for fair \(k\)-center problem with outliers and capacity constraints
• Fully dynamic clustering and diversity maximization in doubling metrics
• Graph burning and non-uniform \(k\)-centers for small treewidth
• The fair \(k\)-center with outliers problem: FPT and polynomial approximations
• Parameterized approximation algorithms and lower bounds for k-center clustering and variants
• Connected k-center and k-diameter clustering
• A constant-factor approximation for pairwise fair k-center clustering
• Generalized k-center: distinguishing doubling and highway dimension
• Burning path-like and clique-like graphs
• Fault-tolerant k-supplier with outliers
• An approximation algorithm for the parity-constrained k-supplier problem
• Approximation algorithms for continuous clustering and facility location problems
• Parity-constrained k-supplier problem
• Revisiting priority k-center: fairness and outliers

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

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