Sorting under partial (interval order) information
In this paper we study how to efficiently order a set of imprecise points. In one dimension, the order of a set of points is their sorted order from low to high. A set of imprecise points in the preprocessing model consists of a set of $n$ uncertainty regions $\mathcal{R} = \{R_1, R_2, \ldots R_n \...
-д хадгалсан:
| Үндсэн зохиолчид: | , , , |
|---|---|
| Формат: | Artigo |
| Хэл сонгох: | Inglês |
| Хэвлэсэн: |
Carleton University
2024-11-01
|
| Цуврал: | Journal of Computational Geometry |
| Онлайн хандалт: | https://jocg.org/index.php/jocg/article/view/3924 |
| Шошгууд: |
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
|