The following pages link to All-norm approximation algorithms (Q4815768):
Displaying 15 items.
- Fair online load balancing (Q398848) (← links)
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715) (← links)
- Simultaneous approximation of multi-criteria submodular function maximization (Q489121) (← links)
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- Maximum bipartite flow in networks with adaptive channel width (Q541660) (← links)
- Optimal location with equitable loads (Q1026600) (← links)
- 2-approximation algorithm for a generalization of scheduling on unrelated parallel machines (Q1799571) (← links)
- Surrogate optimization for \(p\)-norms (Q2010926) (← links)
- Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
- Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints (Q2222091) (← links)
- Non-clairvoyantly scheduling to minimize convex functions (Q2319644) (← links)
- Approximate strong equilibria in job scheduling games with two uniformly related machines (Q2446828) (← links)
- A Unified Approach to Truthful Scheduling on Related Machines (Q2800378) (← links)
- Simpler and Better Algorithms for Minimum-Norm Load Balancing (Q5075764) (← links)
- (Q5075765) (← links)
