Approximation Algorithms for the Max-Min Allocation Problem

DOI10.1007/978-3-540-74208-1_15zbMath1171.91354OpenAlexW2147981433MaRDI QIDQ3603466

Subhash A. Khot, Ashok Kumar Ponnuswami

Publication date: 17 February 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74208-1_15

Mathematics Subject Classification ID

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

Related Items (5)

A Protocol for Cutting Matroids Like Cakes ⋮ Unnamed Item ⋮ A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation ⋮ On \((1, \epsilon )\)-restricted max-min fair allocation problem ⋮ Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings

This page was built for publication: Approximation Algorithms for the Max-Min Allocation Problem