Min sum clustering with penalties
From MaRDI portal
Publication:976485
DOI10.1016/J.EJOR.2010.03.004zbMath1188.90265OpenAlexW1989451490MaRDI QIDQ976485
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
Programming involving graphs or networks (90C35) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (2)
Dominant-set clustering: a review ⋮ The Prize-collecting Call Control Problem on Weighted Lines and Rings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the hardness of approximating minimum vertex cover
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- Approximation algorithms for min-sum \(p\)-clustering
- Approximation algorithms for maximum dispersion
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
- A randomized approximation scheme for metric MAX-CUT
- An overlapping cluster algorithm to provide non-exhaustive clustering
- The minimum generalized vertex cover problem
- Property testing and its connection to learning and approximation
- Improved Inapproximability of Lattice and Coding Problems With Preprocessing
- Approximation schemes for clustering problems
- Scheduling with Outliers
- P-Complete Approximation Problems
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Probability Inequalities for Sums of Bounded Random Variables
- The dense \(k\)-subgraph problem
This page was built for publication: Min sum clustering with penalties