Pages that link to "Item:Q2800378"
From MaRDI portal
The following pages link to A unified approach to truthful scheduling on related machines (Q2800378):
Displaying 13 items.
- A truthful constant approximation for maximizing the minimum load on related machines (Q388122) (← links)
- Maximizing the minimum load: the cost of selfishness (Q390908) (← links)
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- Mechanisms for scheduling with single-bit private values (Q904689) (← links)
- Copula-based randomized mechanisms for truthful scheduling on two unrelated machines (Q904694) (← links)
- Deterministic monotone algorithms for scheduling on related machines (Q952439) (← links)
- Truthful mechanisms for two-range-values variant of unrelated scheduling (Q1019737) (← links)
- The cost of selfishness for maximizing the minimum load on uniformly related machines (Q2015810) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- (Q5417684) (← links)
- Approximation and Online Algorithms (Q5713443) (← links)
- A new lower bound for deterministic truthful scheduling (Q5918088) (← links)
- Well-behaved online load balancing against strategic jobs (Q6090218) (← links)