Competitive-ratio approximation schemes for makespan scheduling problems

DOI10.1007/978-3-642-38016-7_14zbMATH Open1395.68343OpenAlexW117086416MaRDI QIDQ2848922FDOQ2848922

Authors: Adam Kurpisz, Monaldo Mastrolilli, Georgios Stamoulis 

Publication date: 13 September 2013

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38016-7_14

Recommendations

• A new approach to online scheduling: approximating the optimal competitive ratio
• Approximating the optimal algorithm for online scheduling problems via dynamic programming
• A new approach to online scheduling: approximating the optimal competitive ratio

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Cited In (4)

• A new approach to online scheduling: approximating the optimal competitive ratio
• A new approach to online scheduling: approximating the optimal competitive ratio
• Approximating the optimal algorithm for online scheduling problems via dynamic programming
• Title not available (Why is that?)

This page was built for publication: Competitive-ratio approximation schemes for makespan scheduling problems

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