Efficient Algorithms for k-Regret Minimizing Sets (Q4580150)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient Algorithms for k-Regret Minimizing Sets |
scientific article; zbMATH DE number 6917122
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient Algorithms for k-Regret Minimizing Sets |
scientific article; zbMATH DE number 6917122 |
Statements
13 August 2018
0 references
regret-minimizing sets
0 references
skyline
0 references
top-\(k\) query
0 references
coreset
0 references
hitting set
0 references
Efficient Algorithms for k-Regret Minimizing Sets (English)
0 references
0.9755995
0 references
0.9512844
0 references
0.89310837
0 references
0.8773133
0 references
0.87395394
0 references
0.87366486
0 references
0.87042767
0 references
0.8686216
0 references
0.8677709
0 references
