Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates
From MaRDI portal
Publication:4554931
DOI10.1145/3086464zbMath1452.68273arXiv1203.6397OpenAlexW2735816714MaRDI QIDQ4554931
Aadhar Jain, Yuli Ye, Allan Borodin, Hyun Chul Lee
Publication date: 12 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.6397
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)
Related Items (9)
Diverse partitions of colored points ⋮ Provable randomized rounding for minimum-similarity diversification ⋮ Result diversification by multi-objective evolutionary algorithms with theoretical guarantees ⋮ Obtaining approximately optimal and diverse solutions via dispersion ⋮ Top-\(k\) overlapping densest subgraphs ⋮ Weakly Submodular Function Maximization Using Local Submodularity Ratio. ⋮ On the Complexity of Query Result Diversification ⋮ Hardness results for multimarginal optimal transport problems ⋮ Maximization problems of balancing submodular relevance and supermodular diversity
This page was built for publication: Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates
