scientific article; zbMATH DE number 7561387

DOI10.4230/LIPIcs.ISAAC.2018.33MaRDI QIDQ5091024

Alfonso Cevallos, Sarah Morell, Friedrich Eisenbrand

Publication date: 21 July 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

information retrievalfacility locationdoubling dimension\(\varepsilon\)-netspolynomial time approximation schemeremote-cliquegrid roundingremote-bipartitionremote-star

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Selecting a subset of diverse points based on the squared Euclidean distance ⋮ Maximizing single attribute diversity in group selection ⋮ \(t\)-linearization for the maximum diversity problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A nonlinear approach to dimension reduction
• A study on two geometric location problems
• Approximation algorithms for maximum dispersion
• Maximum dispersion and geometric maximum weight cliques
• An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
• Approximation Algorithms for Dispersion Problems
• Max-sum diversity via convex programming
• Nearest-neighbor-preserving embeddings
• Heuristic and Special Case Algorithms for Dispersion Problems
• Local Search for Max-Sum Diversification

This page was built for publication: