scientific article; zbMATH DE number 6783452

zbMath1373.68449arXiv1007.2503MaRDI QIDQ5365100

Iftah Gamzu, Yossi Azar

Publication date: 29 September 2017

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

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (6)

Ignorant vs. Anonymous Recommendations ⋮ Ranking with submodular functions on a budget ⋮ Product sequencing and pricing under cascade browse model ⋮ Adaptive Submodular Ranking and Routing ⋮ On competitive recommendations ⋮ A Tight Bound for Stochastic Submodular Cover

This page was built for publication: