scientific article; zbMATH DE number 5764883
From MaRDI portal
Publication:3579476
Cited in
(23)- Semi-online machine covering for two uniform machines
- Restricted max-min allocation: integrality gap and approximation algorithm
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
- Multistage online maxmin allocation of indivisible entities
- Santa Claus Meets Hypergraph Matchings
- A truthful constant approximation for maximizing the minimum load on related machines
- Approximating the Nash Social Welfare with Indivisible Items
- On the configuration-LP for scheduling on unrelated machines
- Restricted Max-Min Fair Allocation
- Restricted max-min allocation: approximation and integrality gap
- Lazy local search meets machine scheduling
- The entropy rounding method in approximation algorithms
- Online max-min fair allocation
- Fair division of indivisible goods: recent progress and open questions
- Better trees for Santa Claus
- On min-max graph balancing with strict negative correlation constraints
- Fast algorithms for maximizing the minimum eigenvalue in fixed dimension
- Improved integrality gap in max-min allocation, or, topology at the north pole
- The submodular Santa Claus problem in the restricted assignment case
- Additive approximation schemes for load balancing problems
- On \((1, \epsilon )\)-restricted max-min fair allocation problem
- Strong LP formulations for scheduling splittable jobs on unrelated machines
- On the configuration LP for maximum budgeted allocation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579476)
