Min sum clustering with penalties
From MaRDI portal
Publication:976485
DOI10.1016/J.EJOR.2010.03.004zbMATH Open1188.90265OpenAlexW1989451490MaRDI QIDQ976485FDOQ976485
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
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Programming involving graphs or networks (90C35) Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probability Inequalities for Sums of Bounded Random Variables
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- Algorithms for facility location problems with outliers. (Extended abstract)
- Property testing and its connection to learning and approximation
- The dense \(k\)-subgraph problem
- On the hardness of approximating minimum vertex cover
- Scheduling with Outliers
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
- P-Complete Approximation Problems
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- The minimum generalized vertex cover problem
- Approximation schemes for clustering problems
- Approximation algorithms for min-sum \(p\)-clustering
- Improved Inapproximability of Lattice and Coding Problems With Preprocessing
- A randomized approximation scheme for metric MAX-CUT
- Approximation algorithms for maximum dispersion
- An overlapping cluster algorithm to provide non-exhaustive clustering
Cited In (4)
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)
