All-Norm Approximation Algorithms

DOI10.1007/3-540-45471-3_30zbMath1078.90527OpenAlexW1604192610MaRDI QIDQ3046503

Leah Epstein, Gerhard J. Woeginger, Yossi Richter, Yossi Azar

Publication date: 12 August 2004

Published in: Algorithm Theory — SWAT 2002 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45471-3_30

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (4)

A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm ⋮ Unnamed Item ⋮ Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs ⋮ On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines

This page was built for publication: All-Norm Approximation Algorithms