Efficient processing of \(k\)-regret minimization queries with theoretical guarantees

DOI10.1016/j.ins.2021.11.080arXiv2103.11630OpenAlexW3217026425MaRDI QIDQ6154451

No author found.

Publication date: 15 February 2024

Published in: Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

curvatureregret minimizationskyline querysubmodularity ratio

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recurrent neural variational model for follower-based influence maximization
• Submodular functions and optimization.
• An analysis of approximations for maximizing submodular set functions—I
• Efficient Algorithms for k-Regret Minimizing Sets
• K-Regret Queries Using Multiplicative Utility Functions
• Faster Approximation Algorithm for the k-Regret Minimizing Set and Related Problems
• Fast algorithms for maximizing submodular functions

This page was built for publication: Efficient processing of \(k\)-regret minimization queries with theoretical guarantees