A Greedy Approximation Algorithm for Minimum-Gap Scheduling

DOI10.1007/978-3-642-38233-8_9zbMath1382.68331OpenAlexW38155029MaRDI QIDQ4924641

Joseph (Seffi) Naor, Sanjeev Khanna, Fei Li, Marek Chrobak, Mohammad Taghi Hajiaghayi

Publication date: 7 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38233-8_9

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (2)

Scheduling with Gaps: New Models and Algorithms ⋮ Scheduling with gaps: new models and algorithms

This page was built for publication: A Greedy Approximation Algorithm for Minimum-Gap Scheduling