1. A quasi-PTAS for the two-dimensional geometric knapsack problem;Anna Adamaszek;Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms,2015
2. The approximability of assortment optimization under ranking preferences;Ali Aouad;Operations Research,2018
3. Approximation algorithms for dynamic assortment optimization models;Ali Aouad;Mathematics of Operations Research,2019
4. Approximation schemes for NP-hard geometric optimization problems: A survey;Sanjeev Arora;Mathematical Programming,2003
5. Approximation schemes for minimum latency problems;Sanjeev Arora;SIAM Journal on Computing,2003