Ignorant vs. Anonymous Recommendations
DOI10.1007/978-3-662-48350-3_83zbMath1466.68068OpenAlexW2398325232MaRDI QIDQ3452859
Publication date: 19 November 2015
Published in: Algorithms - ESA 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48350-3_83
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Data structures (68P05) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding similar users in social networks
- Tell me who I am: An interactive recommendation system
- A competitive analysis of the list update problem with lookahead
- On chromatic sums and distributed resource allocation
- Approximating min sum set cover
- On Competitive Recommendations
- An Ascending Vickrey Auction for Selling Bases of a Matroid
- Learning Binary Relations and Total Orders
- Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
- Stochastic Covering and Adaptivity
- Competitive recommendation systems
- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
- Database Theory - ICDT 2005
This page was built for publication: Ignorant vs. Anonymous Recommendations