scientific article; zbMATH DE number 7278033

DOI10.4230/LIPIcs.ISAAC.2017.28zbMath1457.68286arXiv1707.09904MaRDI QIDQ5136247

Anastasios Sidiropoulos, Alfred Rossi, Tamal Krishna Dey

Publication date: 25 November 2020

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

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

zbMATH Keywords

multi-objective optimizationclusteringhierarchical clusteringapproximation algorithmsdynamic metric spacesmoving point sets

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Metric spaces, metrizability (54E35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Uses Software

• k-means++

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithm for the kinetic robust \(k\)-center problem
• A Best Possible Heuristic for the k-Center Problem
• Faster Scaling Algorithms for Network Problems
• A robust model for finding optimal evolutionary trees
• Deformable spanners and applications
• Kinetic spanners in R ^d

This page was built for publication: