scientific article; zbMATH DE number 7378621
From MaRDI portal
Publication:5009501
DOI10.4230/LIPIcs.APPROX-RANDOM.2018.9MaRDI QIDQ5009501
Chandra Chekuri, Shalmoli Gupta
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1806.04202
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Robust \(k\)-center with two types of radii ⋮ On perturbation resilience of non-uniform \(k\)-center
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Center-based clustering under perturbation stability
- Clustering to minimize the maximum intercluster distance
- A constant-factor approximation algorithm for the k -median problem (extended abstract)
- Are Stable Instances Easy?
- On the practically interesting instances of MAXCUT
- Improved Spectral-Norm Bounds for Clustering
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Asymmetric k -center is log * n -hard to approximate
- A Best Possible Heuristic for the k-Center Problem
- k-Center Clustering Under Perturbation Resilience
- Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers
- Least squares quantization in PCM
- Outlier Analysis
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- Algorithms for stable and perturbation-resilient problems
- Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
- Constant approximation for k-median and k-means with outliers via iterative rounding
- Bilu–Linial Stable Instances of Max Cut and Minimum Multiway Cut
- Clustering under Perturbation Resilience
This page was built for publication:
