Thông tin tài liệu


Nhan đề : 
Faster distance-based representative skyline and k-center along pareto front in the plane
Tác giả : 
Sergio, Cabello
Năm xuất bản : 
2023
Nhà xuất bản : 
Springer
Tóm tắt : 
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.
Mô tả: 
CC BY
URI: 
https://link.springer.com/article/10.1007/s10898-023-01280-1
https://dlib.phenikaa-uni.edu.vn/handle/PNK/7647
Bộ sưu tập
OER - Khoa học Tự nhiên
XEM MÔ TẢ

11

XEM TOÀN VĂN

22

Danh sách tệp tin đính kèm: