The following pages link to (Q3579476):
Displaying 17 items.
- A truthful constant approximation for maximizing the minimum load on related machines (Q388122) (← links)
- 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)
- On the configuration LP for maximum budgeted allocation (Q896296) (← links)
- Semi-online machine covering for two uniform machines (Q1034625) (← links)
- Restricted max-min allocation: integrality gap and approximation algorithm (Q2149096) (← links)
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693) (← links)
- Multistage online maxmin allocation of indivisible entities (Q2676469) (← links)
- Santa Claus Meets Hypergraph Matchings (Q3541783) (← links)
- Approximating the Nash Social Welfare with Indivisible Items (Q4571931) (← links)
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
- Restricted Max-Min Fair Allocation (Q5002708) (← links)
- (Q5091188) (← links)
- Lazy Local Search Meets Machine Scheduling (Q5237306) (← links)
- (Q5743405) (← links)
- Fair division of indivisible goods: recent progress and open questions (Q6136107) (← links)
