Breaking the 3/4 Barrier for Approximate Maximin Share

Akrami, Hannaneh; Garg, Jugal

doi:10.1137/1.9781611977912

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Breaking the 3/4 Barrier for Approximate Maximin Share

MPS-Authors

/persons/resource/persons263365

Akrami, Hannaneh
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://epubs.siam.org/doi/10.1137/1.9781611977912.4
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

arXiv:2307.07304.pdf
(Preprint), 394KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Akrami, H., & Garg, J. (2024). Breaking the 3/4 Barrier for Approximate Maximin Share. In D. P. Woodruff (Ed.), Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 74-91). Philadelphia, PA: SIAM. doi:10.1137/1.9781611977912.

Cite as: https://hdl.handle.net/21.11116/0000-000F-1439-B

Abstract

There is no abstract available