Solving the chromatic cone clustering problem via minimum spanning sphere

DOI10.1007/978-3-642-22006-7_65MaRDI QIDQ3012849zbMATH OpenOpenAlexFDO

Authors Hu Ding, Jinhui Xu

Publication date 6 July 2011

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22006-7_65

zbMATH Keywords

chromatic cone clusteringcore-sethigh dimension

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• The approximation algorithms for a class of multiple-choice problem
• On some geometric problems of color-spanning sets
• Approximation algorithms for color spanning diameter
• On some geometric problems of color-spanning sets
• On approximability of minimum color-spanning ball in high dimensions

Cites work

• Approximate clustering via core-sets
• Farthest-Polygon Voronoi Diagrams
• scientific article; zbMATH DE number 5764862 (Why is no real title available?)
• scientific article; zbMATH DE number 2079414 (Why is no real title available?)
• scientific article; zbMATH DE number 5019895 (Why is no real title available?)
• On the complexity of some geometric problems in unbounded dimension
• The upper envelope of Voronoi surfaces and its applications

Cited in

(10)

• Bichromatic 2-center of pairs of points
• A unified framework for clustering constrained data without locality property
• Improved PTAS for the constrained \(k\)-means problem
• Tight FPT approximation for constrained k-center and k-supplier
• On clustering induced Voronoi diagrams
• Privacy preserving clustering with constraints
• On geometric prototype and applications
• A unified framework of FPT approximation algorithms for clustering problems
• O(1)-Round MPC algorithms for multi-dimensional grid graph connectivity, Euclidean MST and DBSCAN
• Improved algorithms for the bichromatic two-center problem for pairs of points

This page was built for publication: Solving the chromatic cone clustering problem via minimum spanning sphere

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3012849)