scientific article; zbMATH DE number 7758333

DOI10.4230/lipics.approx/random.2020.31MaRDI QIDQ6062155

Sayan Bandyapadhyay

Publication date: 31 October 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

stabilityclusteringperturbation resiliencenon-uniform \(k\)-center

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Center-based clustering under perturbation stability
• The firefighter problem for cubic graphs
• Clustering to minimize the maximum intercluster distance
• Embedding tree metrics into low-dimensional Euclidean spaces
• \(k\)-means++ under approximation stability
• The firefighter problem for graphs of maximum degree three
• Are Stable Instances Easy?
• On the Complexity of the Metric TSP under Stability Considerations
• Asymmetric k -center is log ^* n -hard to approximate
• A Best Possible Heuristic for the k-Center Problem
• Firefighting on Trees Beyond Integrality Gaps
• k-Center Clustering Under Perturbation Resilience
• Approximate Clustering via Metric Partitioning
• An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
• Algorithms for stable and perturbation-resilient problems
• Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS
• Bilu–Linial Stable Instances of Max Cut and Minimum Multiway Cut
• The effectiveness of lloyd-type methods for the k-means problem
• The complexity of satisfiability problems
• Clustering under Perturbation Resilience

This page was built for publication: