Exact algorithms for size constrained 2-clustering in the plane
DOI10.1016/J.TCS.2015.10.005zbMATH Open1339.68226DBLPjournals/tcs/LinBG16OpenAlexW2132011326WikidataQ59538789 ScholiaQ59538789MaRDI QIDQ288798FDOQ288798
Authors: Jianyi Lin, Massimiliano Goldwurm, Alberto Bertoni 
Publication date: 27 May 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.10.005
Recommendations
- Exact algorithms for 2-clustering with size constraints in the Euclidean plane
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems
- Exact and approximation algorithms for clustering
- A 2-approximation algorithm for the graph 2-clustering problem
- Exact pseudo-polynomial algorithms for a balanced 2-clustering problem
- scientific article; zbMATH DE number 1303609
- 2-approximation algorithms for two graph clustering problems
- A 2-approximation polynomial algorithm for a clustering problem
- scientific article; zbMATH DE number 7525470
- On the complexity of clustering with relaxed size constraints in fixed dimension
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- Pattern recognition and machine learning.
- NP-hardness of Euclidean sum-of-squares clustering
- Introduction to algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved bounds for planar \(k\)-sets and related problems
- The planar \(k\)-means problem is NP-hard
- Norm statistics and the complexity of clustering problems
- Maintenance of configurations in the plane
- Minimum sum of squares clustering in a low dimensional space
- General equation for taxicab conics and their classification
- Size constrained distance clustering: separation properties and some complexity results
- Exact algorithms for 2-clustering with size constraints in the Euclidean plane
- Integer Programming and the Theory of Grouping
- \(k\)-means requires exponentially many iterations even in the plane
- Title not available (Why is that?)
Cited In (8)
- On the Complexity of Clustering with Relaxed Size Constraints
- An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem
- A finite exact algorithm for epsilon-core membership in two dimensions
- On the complexity of clustering with relaxed size constraints in fixed dimension
- Exact algorithms for 2-clustering with size constraints in the Euclidean plane
- NP-hardness of \(m\)-dimensional weighted matching problems
- Geometric clustering in normed planes
- Some clustering algorithms in normed planes
Uses Software
This page was built for publication: Exact algorithms for size constrained 2-clustering in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q288798)
