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...

Celý popis

Podrobná bibliografia

Vydané v:	Information processing letters Ročník 177; s. 106272
Hlavný autor:	Deng, Shichuan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.08.2022
Predmet:	Approximation algorithms Clustering with discounts Knapsack constraint Matroid constraint Approximation algorithms Matroid constraint Clustering with discounts Knapsack constraint
ISSN:	0020-0190, 1872-6119
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!