An Improved Approximation Guarantee for the Maximum Budgeted Allocation Problem

DOI10.1137/1.9781611974331.ch74zbMath1411.68195arXiv1511.09293OpenAlexW2952143488MaRDI QIDQ4575654

Christos Kalaitzis

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.09293

Mathematics Subject Classification ID

Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (1)

Analysis of the Period Recovery Error Bound

This page was built for publication: An Improved Approximation Guarantee for the Maximum Budgeted Allocation Problem