| Open Document File Size: 223,66 KBShare Result on Facebook
Company Constructing Stable Solutions / Robust Solutions / / / Event Reorganization / / Facility Jos´e Verschae Institute of Mathematics / / Holiday Assumption / / IndustryTerm α-competitive algorithms / relaxed online scenario / online load balancing / minimal solution / list scheduling algorithm / considered online scheduling problem / online scenario / online variant / randomized online algorithms / near-optimal solutions / online version / approximate solution / deterministic online algorithm / classical online setting / optimum solutions / online algorithm / fundamental online scheduling problems / tighter online model / possible deterministic algorithm / randomized online algorithm / online setting / online load balancing problems / optimum solution / exhaustive search / storage area networks / / Organization Jos´e Verschae Institute of Mathematics / Berlin Mathematical School / / Person Martin Skutella / / Position somewhat tighter online model / known as the bounded migration framework / / ProgrammingLanguage A# / / Technology online algorithm / following algorithm / load balancing / randomized online algorithms / randomized online algorithm / deterministic online algorithm / ESA / possible deterministic algorithm / list scheduling algorithm / procedure Algorithm / /
SocialTag |
A Robust PTAS for Machine Covering and Packing! Martin Skutella and Jos´e Verschae Institute of Mathematics, TU Berlin, Germany {skutella,verschae}@math.tu-berlin.de Abstract. Minimizing the makespan or maximizing the m