Skyline Computation with Noisy Comparisons

DOI10.1007/978-3-030-48966-3_22MaRDI QIDQ5041199zbMATH OpenOpenAlexFDO

Authors Benoît Groz, Frederik Mallmann-Trenn, Claire Mathieu, Víctor Verdugo

Publication date 13 October 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1710.02058

zbMATH Keywords

fault-toleranceskylinenoisy comparisons

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Recommendations

• The most-likely skyline problem for stochastic points
• (Approximate) uncertain skylines
• Output-sensitive skyline algorithms in external memory
• Computation of spatial skyline points
• Dynamic planar range skyline queries in log logarithmic expected time

Cites work

• scientific article; zbMATH DE number 5899292 (Why is no real title available?)
• (Approximate) uncertain skylines
• Computing in fault tolerant broadcast networks and noisy decision trees
• Computing with Noisy Information
• Fast computation of output-sensitive maxima in a word RAM
• Instance-optimal geometric algorithms
• On Finding the Maxima of a Set of Vectors
• On constant factors in comparison-based geometric algorithms and data structures
• On the Distribution of the Number of Admissible Points in a Vector Random Sample
• Optimal output-sensitive convex hull algorithms in two and three dimensions
• Orthogonal range searching on the RAM, revisited
• Parallel algorithms for select and partition with noisy comparisons
• Parallel skyline queries
• Top-\(k\) and clustering with noisy comparisons

Cited in

(1)

• Group skyline computation

This page was built for publication: Skyline Computation with Noisy Comparisons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041199)