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

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 177; s. 106272
Hlavní autor: Deng, Shichuan
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.08.2022
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 contribution being zero. We obtain a bi-criteria constant-factor approximation using an iterative LP rounding algorithm. Our result improves the previously best approximation guarantee for k-median with discounts (Ganesh et al. (2001) [9]). We also devise bi-criteria constant-factor approximation algorithms for the matroid and knapsack versions of median clustering with discounts. •Investigate clustering problems with discounts subject to general constraints.•Devise constant approximation algorithms using a unified iterative LP rounding method.•Modestly improve previously-known approximation guarantee for k-median with discounts.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2022.106272