The following pages link to (Q3549603):
Displaying 17 items.
- A truthful constant approximation for maximizing the minimum load on related machines (Q388122) (← links)
- Fair division of indivisible items between two players: design parameters for contested pile methods (Q483924) (← links)
- On-line machine covering on two machines with local migration (Q660883) (← links)
- On \((1, \epsilon )\)-restricted max-min fair allocation problem (Q724228) (← 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)
- General max-min fair allocation (Q2695275) (← links)
- Approximation Algorithms for Computing Maximin Share Allocations (Q3448772) (← links)
- Santa Claus Meets Hypergraph Matchings (Q3541783) (← links)
- Nash Social Welfare, Matrix Permanent, and Stable Polynomials (Q4638089) (← links)
- Fair Allocation of Indivisible Goods: Improvement (Q4958554) (← links)
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
- Restricted Max-Min Fair Allocation (Q5002708) (← links)
- (Q5091188) (← links)
- (Q5743454) (← links)
- Polynomial-time combinatorial algorithm for general max-min fair allocation (Q6182677) (← links)