The following pages link to The Santa Claus problem (Q2931367):
Displaying 27 items.
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
- Restricted Max-Min Fair Allocation (Q5002708) (← links)
- Fair Packing of Independent Sets (Q5041187) (← links)
- (Q5075832) (← links)
- (Q5091188) (← links)
- (Q5091233) (← links)
- A Quasi-Polynomial Approximation for the Restricted Assignment Problem (Q5138780) (← links)
- Coalition formation in social environments with logic-based agents1 (Q5145446) (← links)
- Duplication monotonicity in the allocation of indivisible goods (Q5145454) (← links)
- (Q5159440) (← links)
- Lazy Local Search Meets Machine Scheduling (Q5237306) (← links)
- Compact LP Relaxations for Allocation Problems (Q5240426) (← links)
- Maximizing the Minimum Load for Selfish Agents (Q5458534) (← links)
- Online Bounded Analysis (Q5740182) (← links)
- The snowblower problem (Q5893868) (← links)
- The snowblower problem (Q5894212) (← links)
- The existence of universally agreed fairest semi-matchings in any given bipartite graph (Q5918112) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings (Q6075859) (← links)
- Machine covering in the random-order model (Q6103518) (← links)
- Fair division of indivisible goods: recent progress and open questions (Q6136107) (← links)
- Allocation of indivisible items with individual preference graphs (Q6157417) (← links)
- Polynomial-time combinatorial algorithm for general max-min fair allocation (Q6182677) (← links)
- Maximin fair allocation of indivisible items under cost utilities (Q6546293) (← links)
- A constant-factor approximation for generalized malleable scheduling under \(M^{\natural }\)-concave processing speeds (Q6589760) (← links)
- Collective decision making (Q6602233) (← links)
- Time-sharing scheduling with tolerance capacities (Q6655677) (← links)
