Abstract
We provide a 3/2-approximation algorithm for an offline budgeted allocations problem with applications to sponsored search auctions. This an improvement over the e/(e - 1) approximation of Andelman and Mansour [1] and the e/(e - 1) - ε approximation (for ε ≈ 0.0001) of Feige and Vondrak [2] for the more general Maximum Submodular Welfare (SMW) problem. For a special case of our problem, we improve this ratio to √2. We also show that the problem is APX-hard. © 2008 Springer-Verlag.
Cite
CITATION STYLE
Azar, Y., Birnbaum, B., Karlin, A. R., Mathieu, C., & Nguyen, C. T. (2008). Improved approximation algorithms for budgeted allocations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5125 LNCS, pp. 186–197). Springer Verlag. https://doi.org/10.1007/978-3-540-70575-8_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
