|
|||||
|
|
A technique for obtaining true approximations for k-center with covering constraints |
|
| Authors: | Anegg Georg Angelidakis Haris Kurpisz Adam Zenklusen Rico |
| Affiliation: | 1.Department of Mathematics, ETH Zurich, Zurich, Switzerland ;2.Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands ; |
| Abstract: | Mathematical Programming - There has been a recent surge of interest in incorporating fairness aspects into classical clustering problems. Two recently introduced variants of the k-Center problem... |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |