Pages that link to "Item:Q1362519"
From MaRDI portal
The following pages link to A polynomial-time approximation scheme for maximizing the minimum machine completion time (Q1362519):
Displaying 25 items.
- A unified approach to truthful scheduling on related machines (Q2800378) (← links)
- A Protocol for Cutting Matroids Like Cakes (Q2937759) (← links)
- GRAPH ORIENTATION TO MAXIMIZE THE MINIMUM WEIGHTED OUTDEGREE (Q2997922) (← links)
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures (Q3186540) (← links)
- Approximation Algorithms for Computing Maximin Share Allocations (Q3448772) (← links)
- Parallel machine scheduling problems with proportionally deteriorating jobs (Q3612784) (← links)
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168) (← links)
- (Q4841013) (← links)
- Symmetry exploitation for online machine covering with bounded migration (Q5009591) (← links)
- Ordinal Maximin Share Approximation for Goods (Q5094017) (← links)
- Approximate Maximin Share Allocations in Matroids (Q5283377) (← links)
- SEMI-ONLINE MACHINE COVERING (Q5295439) (← links)
- SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES (Q5315986) (← links)
- Maximizing the Minimum Load for Selfish Agents (Q5458534) (← links)
- Online Bounded Analysis (Q5740182) (← links)
- The Price of Connectivity in Fair Division (Q5864211) (← links)
- Semi-on-line scheduling problems for maximizing the minimum machine completion time (Q5931905) (← links)
- Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs (Q6065410) (← links)
- Mixed coordination mechanisms for scheduling games on hierarchical machines (Q6070429) (← links)
- Machine covering in the random-order model (Q6103518) (← links)
- Fair division of indivisible goods: recent progress and open questions (Q6136107) (← links)
- Envy-free matchings in bipartite graphs and their applications to fair division (Q6154777) (← links)
- Computing fair and efficient allocations with few utility values (Q6159026) (← links)
- Polynomial-time combinatorial algorithm for general max-min fair allocation (Q6182677) (← links)
- Scheduling in manufacturing with transportation: classification and solution techniques (Q6586212) (← links)