All-Norm Approximation Algorithms

DOI10.1007/3-540-45471-3_30MaRDI QIDQ3046503zbMATH OpenOpenAlexFDO

Authors Leah Epstein, Yossi Richter, Gerhard J. Woeginger, 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) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• All-norm approximation algorithms
• Algorithm Theory - SWAT 2004
• All-norms and all-L_p-norms approximation algorithms
• A unified approach to scheduling on unrelated parallel machines
• Convex programming for scheduling unrelated parallel machines

Cited in

(7)

• On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines
• All-norms and all-L_p-norms approximation algorithms
• A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm
• All-norm approximation algorithms
• Algorithm Theory - SWAT 2004
• Approximating the norms of graph spanners
• Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046503)