Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems

From MaRDI portal

Revision as of 19:22, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2848922

Jump to:navigation, search

DOI10.1007/978-3-642-38016-7_14zbMath1395.68343OpenAlexW117086416MaRDI QIDQ2848922

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

Mathematics Subject Classification ID

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

This page was built for publication: Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2848922&oldid=15783142"