Multiple intents re-ranking
From MaRDI portal
Publication:5172763
DOI10.1145/1536414.1536505zbMath1304.68037OpenAlexW2166998862MaRDI QIDQ5172763
Iftah Gamzu, Xiaoxin Yin, Yossi Azar
Publication date: 4 February 2015
Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1536414.1536505
Related Items (7)
Ranking with submodular functions on a budget ⋮ A General Framework for Approximating Min Sum Ordering Problems ⋮ A note on the generalized min-sum set cover problem ⋮ Adaptive Submodular Ranking and Routing ⋮ Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems ⋮ Preemptive and non-preemptive generalized min sum set cover ⋮ Precedence-Constrained Min Sum Set Cover
This page was built for publication: Multiple intents re-ranking
