Diversity maximization in doubling metrics

DOI10.4230/LIPICS.ISAAC.2018.33MaRDI QIDQ5091024FDOQ5091024

Authors: Alfonso Cevallos, Friedrich Eisenbrand, Sarah Morell 

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1809.09521

Recommendations

• Max-sum diversity via convex programming
• Fully dynamic clustering and diversity maximization in doubling metrics
• Maximum diversity problem with squared Euclidean distance
• Local Search for Max-Sum Diversification
• Max-sum diversification, monotone submodular functions, and dynamic updates

zbMATH Keywords

facility locationdoubling dimensioninformation retrieval\(\varepsilon\)-netspolynomial time approximation schemeremote-cliquegrid roundingremote-bipartitionremote-star

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Linear dimensionality reduction: survey, insights, and generalizations
• Geometric approximation algorithms
• Heuristic and Special Case Algorithms for Dispersion Problems
• A study on two geometric location problems
• Title not available (Why is that?)
• Nearest-neighbor-preserving embeddings
• Approximation algorithms for maximum dispersion
• Maximum dispersion and geometric maximum weight cliques
• Approximation algorithms for dispersion problems
• A nonlinear approach to dimension reduction
• An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
• Local Search for Max-Sum Diversification
• Max-sum diversity via convex programming

Cited In (5)

• \(t\)-linearization for the maximum diversity problem
• Multiple Radii DisC Diversity
• Selecting a subset of diverse points based on the squared Euclidean distance
• Maximizing single attribute diversity in group selection
• Resource-based corruptions and the combinatorics of hidden diversity

This page was built for publication: Diversity maximization in doubling metrics

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