ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS

DOI10.1142/S0218195910003372zbMath1198.65044MaRDI QIDQ4931731

Pankaj Kumar, Piyush Kumar

Publication date: 30 September 2010

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

optimizationnumerical examplesclustering\(k\)-centercore-sets

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (1)

A mixed breadth-depth first strategy for the branch and bound tree of Euclidean \(k\)-center problems

Uses Software

• TSPLIB
• Qhull
• Qsplat

Cites Work

• Unnamed Item
• Clustering to minimize the maximum intercluster distance
• The p-cover problem
• The searching over separators strategy to solve some NP-hard problems in subexponential time
• Decomposition Principle for Linear Programs
• On the Complexity of Some Common Geometric Location Problems
• TSPLIB—A Traveling Salesman Problem Library
• Las Vegas algorithms for linear and integer programming when the dimension is small
• An Expander-Based Approach to Geometric Optimization
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
• Approximation algorithms for projective clustering
• A Subexponential Algorithm for Abstract Optimization Problems
• 3-PIERCING OF d-DIMENSIONAL BOXES AND HOMOTHETIC TRIANGLES

This page was built for publication: ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS