Quasi-polynomial local search for restricted max-min fair allocation

DOI10.1007/978-3-642-31594-7_61MaRDI QIDQ2843296zbMATH OpenOpenAlexFDO

Authors Lukáš Poláček, Ola Svensson

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

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

Recommendations

• Quasi-polynomial local search for restricted max-min fair allocation
• Combinatorial algorithm for restricted max-min fair allocation
• Combinatorial Algorithm for Restricted Max-Min Fair Allocation
• Restricted max-min allocation: integrality gap and approximation algorithm
• Restricted Max-Min Fair Allocation

Cited in

(10)

• scientific article; zbMATH DE number 7561531 (Why is no real title available?)
• Restricted max-min allocation: integrality gap and approximation algorithm
• On \((1, \epsilon )\)-restricted max-min fair allocation problem
• Strong LP formulations for scheduling splittable jobs on unrelated machines
• Quasi-polynomial local search for restricted max-min fair allocation
• On \((1,\varepsilon)\)-restricted max-min fair allocation problem
• A polynomial algorithm for maxmin and minmax envy-free rent division on a soft budget
• Restricted Max-Min Fair Allocation
• Lazy local search meets machine scheduling
• Combinatorial algorithm for restricted max-min fair allocation

This page was built for publication: Quasi-polynomial local search for restricted max-min fair allocation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2843296)