Min sum clustering with penalties

DOI10.1016/J.EJOR.2010.03.004MaRDI QIDQ976485zbMATH OpenOpenAlexFDO

Authors Refael Hassin, Einat Or

Publication date 11 June 2010

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2010.03.004

zbMATH Keywords

outliersmin sum clusteringrandomized approximation scheme

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Programming involving graphs or networks (90C35) Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• Algorithms – ESA 2005
• Approximation algorithms for min-sum \(p\)-clustering
• Approximating min-sum k -clustering in metric spaces
• Approximation algorithms for clustering to minimize the sum of diameters
• scientific article; zbMATH DE number 1617263

Cites work

• scientific article; zbMATH DE number 5764796 (Why is no real title available?)
• A randomized approximation scheme for metric MAX-CUT
• Algorithms for facility location problems with outliers. (Extended abstract)
• An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
• An overlapping cluster algorithm to provide non-exhaustive clustering
• Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
• Approximation algorithms for maximum dispersion
• Approximation algorithms for min-sum \(p\)-clustering
• Approximation schemes for clustering problems
• Approximation schemes for metric bisection and partitioning
• Improved Inapproximability of Lattice and Coding Problems With Preprocessing
• On the hardness of approximating minimum vertex cover
• P-Complete Approximation Problems
• Probability Inequalities for Sums of Bounded Random Variables
• Property testing and its connection to learning and approximation
• Scheduling with Outliers
• Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
• The dense \(k\)-subgraph problem
• The minimum generalized vertex cover problem

Cited in

(5)

• Dominant-set clustering: a review
• Penalized Probabilistic Clustering
• Algorithms – ESA 2005
• The prize-collecting call control problem on weighted lines and rings
• scientific article; zbMATH DE number 7768361 (Why is no real title available?)

This page was built for publication: Min sum clustering with penalties

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