Faster approximation algorithm for the k-regret minimizing set and related problems

DOI10.1137/1.9781611975055.6MaRDI QIDQ5232723zbMATH OpenOpenAlexFDO

Authors Nirman Kumar, Stavros Sintos

Publication date 12 September 2019

Published in 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611975055.6

Mathematics Subject Classification ID

Approximation algorithms (68W25) Analysis of algorithms (68W40) Decision theory (91B06)

Recommendations

• Efficient Algorithms for k-Regret Minimizing Sets
• k-regret minimizing set: efficient algorithms and hardness
• k-regret queries using multiplicative utility functions
• A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem
• An approximation algorithm for interval data minmax regret combinatorial optimization problems

Cited in

(8)

• k-regret minimizing set: efficient algorithms and hardness
• Efficient Algorithms for k-Regret Minimizing Sets
• k-regret queries using multiplicative utility functions
• Approximating Distance Measures for the Skyline
• Efficient processing of k-regret minimization queries with theoretical guarantees
• Diversity and freshness-aware regret minimizing set queries
• Towards strong regret minimization sets: balancing freshness and diversity in data selection
• Online happiness maximization queries

This page was built for publication: Faster approximation algorithm for the \(k\)-regret minimizing set and related problems

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