Maximization problems of balancing submodular relevance and supermodular diversity
From MaRDI portal
Publication:2070370
DOI10.1007/s10898-021-01063-6zbMath1484.90113OpenAlexW3190376787MaRDI QIDQ2070370
Xiaoyan Zhang, Longkun Guo, Dong-lei Du, Da-Chuan Xu, Zhi-cheng Liu
Publication date: 24 January 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-021-01063-6
Related Items
Guarantees for maximization of \(k\)-submodular functions with a knapsack and a matroid constraint, On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints
Cites Work
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- Maximization of submodular functions: theory and enumeration algorithms
- Approximation algorithms for maximum dispersion
- Parametric monotone function maximization with matroid constraints
- A hybrid metaheuristic method for the maximum diversity problem
- Iterated tabu search for the maximum diversity problem
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
- Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
- Heuristic and Special Case Algorithms for Dispersion Problems
- Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates
- Local Search for Max-Sum Diversification
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
- The Data-Correcting Algorithm for the Minimization of Supermodular Functions
- Approximation of geometric dispersion problems
