All-norm approximation algorithms
From MaRDI portal
Publication:4815768
DOI10.1016/j.jalgor.2004.02.003zbMath1072.68130OpenAlexW2070226247MaRDI QIDQ4815768
Gerhard J. Woeginger, Yossi Richter, Leah Epstein, Yossi Azar
Publication date: 8 September 2004
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.02.003
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (18)
Energy-Efficient Algorithms for Non-preemptive Speed-Scaling ⋮ Fair online load balancing ⋮ Structural parameters for scheduling with assignment restrictions ⋮ Approximate strong equilibria in job scheduling games with two uniformly related machines ⋮ An efficient polynomial time approximation scheme for load balancing on uniformly related machines ⋮ Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints ⋮ Simultaneous approximation of multi-criteria submodular function maximization ⋮ Truthful mechanism design via correlated tree rounding ⋮ Maximum bipartite flow in networks with adaptive channel width ⋮ Unnamed Item ⋮ Surrogate optimization for \(p\)-norms ⋮ A Unified Approach to Truthful Scheduling on Related Machines ⋮ 2-approximation algorithm for a generalization of scheduling on unrelated parallel machines ⋮ Simpler and Better Algorithms for Minimum-Norm Load Balancing ⋮ Optimal location with equitable loads ⋮ Non-clairvoyantly scheduling to minimize convex functions ⋮ Price-based protocols for fair resource allocation ⋮ Unnamed Item
This page was built for publication: All-norm approximation algorithms
