Improved separated red-blue center clustering

DOI10.1007/978-3-031-22105-7_50MaRDI QIDQ6168980zbMATH OpenOpenAlexFDO

Authors Yuan Sha

Publication date 10 August 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-22105-7_50

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A Best Possible Heuristic for the k-Center Problem
• Analysis of incomplete data and an intrinsic-dimension Helly theorem
• Clustering affine subspaces: hardness and algorithms
• Clustering lines in high-dimensional space, classification of incomplete data
• Clustering to minimize the maximum intercluster distance
• Covering and piercing disks with two centers
• Easy and hard bottleneck location problems
• Efficient approximation algorithms for clustering point-sets
• Farthest-polygon Voronoi diagrams
• Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane
• Some variations on constrained minimum enclosing circle problem
• THE ALIGNED K-CENTER PROBLEM

This page was built for publication: Improved separated red-blue center clustering

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