Item Infomation
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Sergio, Cabello | - |
| dc.date.accessioned | 2023-04-06T07:44:03Z | - |
| dc.date.available | 2023-04-06T07:44:03Z | - |
| dc.date.issued | 2023 | - |
| dc.identifier.uri | https://link.springer.com/article/10.1007/s10898-023-01280-1 | - |
| dc.identifier.uri | https://dlib.phenikaa-uni.edu.vn/handle/PNK/7647 | - |
| dc.description | CC BY | vi |
| dc.description.abstract | We consider the problem of computing the distance-based representative skyline in the plane, a problem introduced by Tao, Ding, Lin and Pei [Proc. 25th IEEE International Conference on Data Engineering (ICDE), 2009] and independently considered by Dupin, Nielsen and Talbi [Mathematics; Optimization and Learning - Third International Conference, OLA 2020] in the context of multi-objective optimization. Given a set P of n points in the plane and a parameter k, the task is to select k points of the skyline defined by P (also known as Pareto front for P) to minimize the maximum distance from the points of the skyline to the selected points. | vi |
| dc.language.iso | en | vi |
| dc.publisher | Springer | vi |
| dc.subject | ICDE | vi |
| dc.subject | context of multi-objective optimization | vi |
| dc.title | Faster distance-based representative skyline and k-center along pareto front in the plane | vi |
| dc.type | Book | vi |
| Appears in Collections | ||
| OER - Khoa học Tự nhiên | ||
Files in This Item:
