scientific article; zbMATH DE number 7205012

DOI10.4230/LIPIcs.ESA.2017.34zbMath1442.68264arXiv1704.05964MaRDI QIDQ5111721

Anastasios Sidiropoulos, Alfred Rossi, Tamal Krishna Dey

Publication date: 27 May 2020

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

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

zbMATH Keywords

multi-objective optimizationclusteringapproximation algorithmshardness of approximationdynamic metric spacesmoving point sets

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Multi-objective and goal programming (90C29) Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (5)

Parameterized dynamic cluster editing ⋮ Unnamed Item ⋮ Cluster Editing in Multi-Layer and Temporal Graphs. ⋮ Parameterized Dynamic Cluster Editing ⋮ Unnamed Item

Uses Software

• k-means++

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A local search approximation algorithm for \(k\)-means clustering
• Smaller coresets for \(k\)-median and \(k\)-means clustering
• Approximation algorithm for the kinetic robust \(k\)-center problem
• Approximation algorithms for combinatorial problems
• How fast is the \(k\)-means method?
• Clustering motion
• Deformable spanners and applications
• A threshold of ln n for approximating set cover
• Geometric clustering
• A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem
• On coresets for k-means and k-median clustering
• A Best Possible Heuristic for the k-Center Problem
• On the hardness of approximating minimization problems
• Free Bits, PCPs, and Nonapproximability---Towards Tight Results
• Analysis of a Local Search Heuristic for Facility Location Problems
• Clustering time series under the Fréchet distance
• Local Search Heuristics for k-Median and Facility Location Problems
• Faster Scaling Algorithms for Network Problems
• Least squares quantization in PCM
• Analytical approach to parallel repetition
• Kinetic spanners in R ^d

This page was built for publication: