On some variants of Euclidean k-supplier
Year of publication: |
2022
|
---|---|
Authors: | Lee, Euiwoong ; Nagarajan, Viswanath ; Wang, Lily |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 50.2022, 2, p. 115-121
|
Subject: | Approximation algorithms | Clustering | Euclidean spaces | Hardness of approximation | k-center | Outliers | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Submodular maximization through the lens of linear programming
Bruggmann, Simon, (2019)
-
Goerigk, Marc, (2023)
-
Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
Baïou, Mourad, (2023)
- More ...
-
Online generalized network design under (dis)economies of scale
Nagarajan, Viswanath, (2024)
-
Calibration, error analysis, and ongoing measurement process monitoring for mass spectrometry
Vardeman, Stephen B., (2003)
-
Value driver - executing performance management
Wang, Lily, (2004)
- More ...