Robust \(k\)-center with two types of radii

DOI10.1007/978-3-030-73879-2_19zbMath1482.90178arXiv2102.11435OpenAlexW3164657747MaRDI QIDQ5918429

Deeparnab Chakrabarty, Maryam Negahbani

Publication date: 21 December 2021

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.11435

zbMATH Keywords

outliersclusteringapproximationround-or-cut

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Center-based clustering under perturbation stability
• Clustering to minimize the maximum intercluster distance
• Approximability of capacitated network design
• The firefighter problem for graphs of maximum degree three
• LP-Based Algorithms for Capacitated Facility Location
• A Best Possible Heuristic for the k-Center Problem
• Approximating capacitated k-median with (1 + ∊)k open facilities
• Firefighting on Trees Beyond Integrality Gaps
• Algorithms for stable and perturbation-resilient problems
• A Technique for Obtaining True Approximations for k-Center with Covering Constraints
• Fair Colorful k-Center Clustering
• On Uniform Capacitated k-Median Beyond the Natural LP Relaxation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Robust \(k\)-center with two types of radii