On clustering with discounts

We study the k-median with discounts problem, wherein we are given clients with non-negative discounts and seek to open at most k facilities. The goal is to minimize the sum of distances from each client to its nearest open facility which is discounted by its own discount value, with minimum contrib...

Full description

Bibliographic Details

Published in:	Information processing letters Vol. 177; p. 106272
Main Author:	Deng, Shichuan
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.08.2022
Subjects:	Approximation algorithms Clustering with discounts Knapsack constraint Matroid constraint Approximation algorithms Matroid constraint Clustering with discounts Knapsack constraint
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!