Towards strong regret minimization sets: balancing freshness and diversity in data selection

DOI10.1016/j.tcs.2024.114986MaRDI QIDQ6658296

Jianzhong Li, Hong Gao, Hongjie Guo

Publication date: 8 January 2025

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

NP-harddiversityfreshnessregret minimizing set

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Approximately dominating representatives
• Distributing many points on a sphere
• Approximation algorithms for maximum dispersion
• Top-k diversity queries over bounded regions
• Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
• Efficient Algorithms for k-Regret Minimizing Sets
• Faster Approximation Algorithm for the k-Regret Minimizing Set and Related Problems
• Efficient processing of \(k\)-regret minimization queries with theoretical guarantees
• Diversity and freshness-aware regret minimizing set queries

This page was built for publication: Towards strong regret minimization sets: balancing freshness and diversity in data selection