Local Search for Max-Sum Diversification

DOI10.1137/1.9781611974782.9zbMath1410.68397arXiv1607.04557OpenAlexW2508337090MaRDI QIDQ4575743

Friedrich Eisenbrand, Alfonso Cevallos, Rico Zenklusen

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Information storage and retrieval of data (68P20) Approximation algorithms (68W25)

Related Items (8)

Away from each other ⋮ Obtaining approximately optimal and diverse solutions via dispersion ⋮ An Improved Analysis of Local Search for Max-Sum Diversification ⋮ Efficient Approximations for the Online Dispersion Problem ⋮ Dispersing and grouping points on planar segments ⋮ Unnamed Item ⋮ Max-min dispersion on a line ⋮ Maximization problems of balancing submodular relevance and supermodular diversity

This page was built for publication: Local Search for Max-Sum Diversification