Improved approximation algorithms and lower bounds for search-diversification problems

DOI10.4230/LIPICS.ICALP.2022.7MaRDI QIDQ6560790zbMATH OpenFDO

Authors Amir Abboud, Vincent Cohen-Addad, Euiwoong Lee, Pasin Manurangsi

Publication date 24 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2022.7

zbMATH Keywords

approximation algorithmscomplexitydata miningdiversification

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(3)

• Computing diverse and nice triangulations
• On the hardness and approximation of the densest k-subgraph problem in parameterized metric graphs
• Algorithms for the diverse-k-SAT problem: the geometry of satisfying assignments

This page was built for publication: Improved approximation algorithms and lower bounds for search-diversification problems

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