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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information processing letters Jg. 177; S. 106272
1. Verfasser:	Deng, Shichuan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.08.2022
Schlagworte:	Approximation algorithms Clustering with discounts Knapsack constraint Matroid constraint Approximation algorithms Matroid constraint Clustering with discounts Knapsack constraint
ISSN:	0020-0190, 1872-6119
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!