scientific article
From MaRDI portal
Publication:3579385
zbMath1192.68881MaRDI QIDQ3579385
Publication date: 6 August 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation algorithms (68W25)
Related Items (20)
Matroid and knapsack center problems ⋮ On some variants of Euclidean \(k\)-supplier ⋮ Better guarantees for \(k\)-median with service installation costs ⋮ How to find a good explanation for clustering? ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Sampling-based dimension reduction for subspace approximation with outliers ⋮ On the cost of essentially fair clusterings ⋮ Unnamed Item ⋮ Min sum clustering with penalties ⋮ Approximation algorithm for the kinetic robust \(k\)-center problem ⋮ Unnamed Item ⋮ Local search algorithm for the spherical \(k\)-means problem with outliers ⋮ Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems ⋮ Approximation algorithms for the partition vertex cover problem ⋮ Approximation algorithms for the covering-type \(k\)-violation linear program ⋮ An approximation algorithm for the spherical \(k\)-means problem with outliers by local search ⋮ Unnamed Item ⋮ Approximation and complexity of the capacitated geometric median problem
This page was built for publication:
