@inbook {17569,
	title = {Budgeted Allocations in the Full-Information Setting},
	booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and TechniquesApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques},
	series = {Lecture Notes in Computer Science},
	volume = {5171},
	year = {2008},
	month = {2008///},
	pages = {247 - 253},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {We build on the work of Andelman \& Mansour and Azar, Birnbaum, Karlin, Mathieu \& Thach Nguyen to show that the full-information (i.e., offline) budgeted-allocation problem can be approximated to within 4/3: we conduct a rounding of the natural LP relaxation, for which our algorithm matches the known lower-bound on the integrality gap.},
	isbn = {978-3-540-85362-6},
	url = {http://dx.doi.org/10.1007/978-3-540-85363-3_20},
	author = {Srinivasan, Aravind},
	editor = {Goel,Ashish and Jansen,Klaus and Rolim,Jos{\'e} and Rubinfeld,Ronitt}
}
