scientific article
From MaRDI portal
Publication:3579476
zbMath1192.91083MaRDI QIDQ3579476
Publication date: 6 August 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (18)
Approximating the Nash Social Welfare with Indivisible Items ⋮ Restricted max-min allocation: integrality gap and approximation algorithm ⋮ A truthful constant approximation for maximizing the minimum load on related machines ⋮ Multistage online maxmin allocation of indivisible entities ⋮ Strong LP formulations for scheduling splittable jobs on unrelated machines ⋮ On the configuration LP for maximum budgeted allocation ⋮ Online max-min fair allocation ⋮ Fair division of indivisible goods: recent progress and open questions ⋮ A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation ⋮ Santa Claus Meets Hypergraph Matchings ⋮ On the configuration-LP for scheduling on unrelated machines ⋮ Restricted Max-Min Fair Allocation ⋮ Unnamed Item ⋮ On \((1, \epsilon )\)-restricted max-min fair allocation problem ⋮ Semi-online machine covering for two uniform machines ⋮ Lazy Local Search Meets Machine Scheduling ⋮ Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines ⋮ Unnamed Item
This page was built for publication:
