Approximation Algorithms for Diversified Search Ranking

DOI10.1007/978-3-642-14162-1_23zbMath1288.68016OpenAlexW2160321559MaRDI QIDQ3587445

No author found.

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14162-1_23

Mathematics Subject Classification ID

Approximation algorithms (68W25) Internet topics (68M11)

Related Items (2)

Provable randomized rounding for minimum-similarity diversification ⋮ Ranking with submodular functions on a budget

This page was built for publication: Approximation Algorithms for Diversified Search Ranking