A Robust PTAS for Machine Covering and Packing
From MaRDI portal
Publication:3586449
DOI10.1007/978-3-642-15775-2_4zbMath1287.90024OpenAlexW1495408248MaRDI QIDQ3586449
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
Related Items (8)
Simultaneously load balancing for every p-norm, with reassignments ⋮ The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online ⋮ Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures ⋮ A truthful constant approximation for maximizing the minimum load on related machines ⋮ Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem ⋮ Robust algorithms for preemptive scheduling ⋮ On-line machine covering on two machines with local migration ⋮ A Robust AFPTAS for Online Bin Packing with Polynomial Migration
This page was built for publication: A Robust PTAS for Machine Covering and Packing
