A Robust PTAS for Machine Covering and Packing

DOI10.1007/978-3-642-15775-2_4MaRDI QIDQ3586449zbMATH OpenOpenAlexFDO

Authors José Verschae, Martin Skutella

Publication date 6 September 2010

Published in Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL https://depositonce.tu-berlin.de/handle/11303/15693

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 3888915
• A robust APTAS for the classical bin packing problem
• A Robust APTAS for the Classical Bin Packing Problem
• scientific article; zbMATH DE number 823166
• A combination of parallel machine scheduling and the covering problem
• New approaches to covering and packing problems
• Packing and covering with linear programming: a survey
• Packing interdiction and partial covering problems
• A nearly linear-time PTAS for explicit fractional packing and covering linear programs

Cited in

(8)

• Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures
• The power of deferral: maintaining a constant-competitive Steiner tree online
• A truthful constant approximation for maximizing the minimum load on related machines
• Simultaneously load balancing for every p-norm, with reassignments
• Robust algorithms for preemptive scheduling
• A robust AFPTAS for online bin packing with polynomial migration
• Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem
• On-line machine covering on two machines with local migration

This page was built for publication: A Robust PTAS for Machine Covering and Packing

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