Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation

DOI10.1007/978-3-642-31594-7_61zbMath1272.68462OpenAlexW2569791907MaRDI QIDQ2843296

Ola Svensson, Lukáš Poláček

Publication date: 12 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31594-7_61

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (5)

Restricted max-min allocation: integrality gap and approximation algorithm ⋮ Strong LP formulations for scheduling splittable jobs on unrelated machines ⋮ Unnamed Item ⋮ On \((1, \epsilon )\)-restricted max-min fair allocation problem ⋮ Lazy Local Search Meets Machine Scheduling

This page was built for publication: Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation