An improved analysis of local search for max-sum diversification
From MaRDI portal
Recommendations
- Local Search for Max-Sum Diversification
- Max-sum diversity via convex programming
- Max-sum diversification, monotone submodular functions, and dynamic updates
- A simple and effective algorithm for the MaxMin diversity problem
- Approximation Guarantees for Max Sum and Max Min Facility Dispersion with Parameterised Triangle Inequality and Applications in Result Diversification
Cites work
- A threshold of ln n for approximating set cover
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
- Approximation algorithms for maximum dispersion
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Comments on bases in dependence structures
- Geometry of cuts and metrics
- Heuristic and Special Case Algorithms for Dispersion Problems
- scientific article; zbMATH DE number 3829300 (Why is no real title available?)
- Introduction to Information Retrieval
- Local Search for Max-Sum Diversification
- Max-sum diversity via convex programming
- Maximum dispersion and geometric maximum weight cliques
- Metric spaces and completely monontone functions
- Metric Transforms and Euclidean Embeddings
- Monotone submodular maximization over a matroid via non-oblivious local search
- Multi-budgeted matchings and matroid intersection via dependent rounding
- Randomized rounding for the largest simplex problem
- Similarity estimation techniques from rounding algorithms
- Submodular maximization over multiple matroids via generalized exchange properties
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- The Dissimilarity Representation for Pattern Recognition
Cited in
(8)- Provable randomized rounding for minimum-similarity diversification
- Result diversification by multi-objective evolutionary algorithms with theoretical guarantees
- Max-sum diversity via convex programming
- Max-sum diversification, monotone submodular functions, and dynamic updates
- Local Search for Max-Sum Diversification
- Computing diverse and nice triangulations
- Finding diverse strings and longest common subsequences in a graph
- Algorithms for the diverse-k-SAT problem: the geometry of satisfying assignments
This page was built for publication: An improved analysis of local search for max-sum diversification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5108253)
