Diversity and freshness-aware regret minimizing set queries

DOI10.1007/978-3-031-49193-1_19MaRDI QIDQ6591639

Hong Gao, Fangyao Shen, Jianzhong Li, Hongjie Guo

Publication date: 22 August 2024

zbMATH Keywords

NP-harddiversityfreshnessregret minimizing set

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Title not available (Why is that?)
• 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
• Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates
• 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

Related Items (1)

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

This page was built for publication: Diversity and freshness-aware regret minimizing set queries

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