Pages that link to "Item:Q3189065"
From MaRDI portal
The following pages link to Santa claus meets hypergraph matchings (Q3189065):
Displaying 18 items.
- On the configuration-LP for scheduling on unrelated machines (Q490331) (← links)
- On \((1, \epsilon )\)-restricted max-min fair allocation problem (Q724228) (← links)
- Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269) (← links)
- Matching orderable and separable hypergraphs (Q2136876) (← links)
- Restricted max-min allocation: integrality gap and approximation algorithm (Q2149096) (← links)
- A note on the integrality gap of the configuration LP for restricted Santa Claus (Q2203609) (← links)
- General max-min fair allocation (Q2695275) (← links)
- Approximating the Nash Social Welfare with Indivisible Items (Q4571931) (← links)
- Finding independent transversals efficiently (Q4987260) (← links)
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
- Restricted Max-Min Fair Allocation (Q5002708) (← links)
- (Q5091188) (← links)
- (Q5091233) (← links)
- A Quasi-Polynomial Approximation for the Restricted Assignment Problem (Q5138780) (← links)
- Lazy Local Search Meets Machine Scheduling (Q5237306) (← links)
- Compact LP Relaxations for Allocation Problems (Q5240426) (← links)
- Perfect matching in bipartite hypergraphs subject to a demand graph (Q6099389) (← links)
- Polynomial-time combinatorial algorithm for general max-min fair allocation (Q6182677) (← links)
