An improved primal-dual approximation algorithm for the k-means problem with penalties

In the k-means problem with penalties, we are given a data set $${\cal D} \subseteq \mathbb{R}^\ell $$ of n points where each point $$j \in {\cal D}$$ is associated with a penalty cost pj and an integer k. The goal is to choose a set $${\rm{C}}S \subseteq {{\cal R}^\ell }$$ with |CS| ≤ k and a penal...

Full description

Bibliographic Details

Published in:	Mathematical structures in computer science Vol. 32; no. 2; pp. 151 - 163
Main Authors:	Ren, Chunying, Xu, Dachuan, Du, Donglei, Li, Min
Format:	Journal Article
Language:	English
Published:	Cambridge, UK Cambridge University Press 01.02.2022
Subjects:	Algorithms Approximation Artificial intelligence Computer science Customers Fines & penalties Mathematical analysis Polynomials Special Issue: Theory and Applications of Models of Computation (TAMC 2020) approximation algorithm linear program K-means problem with penalties JV algorithm
ISSN:	0960-1295, 1469-8072
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!