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 \...
I tiakina i:
| Ngā kaituhi matua: | , , , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
Carleton University
2024-11-01
|
| Rangatū: | Journal of Computational Geometry |
| Urunga tuihono: | https://jocg.org/index.php/jocg/article/view/3924 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|