ACM Symposium on Discrete Algorithms, SODA 2016

Article Details
Title: An Improved Approximation Guarantee for the Maximum Budgeted Allocation Problem
Article URLs:
Alternative Article URLs:
Authors: Christos Kalaitzis
  • EPFL, School of Computer and Communication Sciences
Sharing: Unknown
Verification: Author has not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/soda/Kalaitzis16
Author Comments:

Discuss this paper and its artifacts below