conference paper
An Improved Approximation Guarantee for the Maximum Budgeted Allocation Problem
2016
Proceedings of the 2016 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
Type
conference paper
Author(s)
Date Issued
2016
Published in
Proceedings of the 2016 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
Start page
1048
End page
1066
Editorial or Peer reviewed
REVIEWED
Written at
OTHER
EPFL units
Available on Infoscience
May 22, 2017
Use this identifier to reference this record