Recommendations
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)
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)