Constant approximation for fault-tolerant median problems via iterative rounding
Shichuan Deng
Year of publication: |
2022
|
---|---|
Authors: | Deng, Shichuan |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 50.2022, 4, p. 384-390
|
Subject: | Approximation algorithm | Fault-tolerant clustering | Knapsack constraint | Matroid constraint | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
Improved approximation algorithms for k-submodular maximization under a knapsack constraint
Ha, Dung T. K., (2024)
-
A refined analysis of submodular greedy
Kulik, Ariel, (2021)
-
Model-free assortment pricing with transaction data
Chen, Ningyuan, (2023)
- More ...