On polynomial-time approximation algorithms for the variable length scheduling problem.
From MaRDI portal
Publication:1401344
DOI10.1016/S0304-3975(03)00141-5zbMath1051.68042OpenAlexW1968885544MaRDI QIDQ1401344
Wojciech Rytter, Daya Ram Gaur, Ramesh Krishnamurti, Artur Czumaj, Michele Zito, Leszek Gąsieniec
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00141-5
Cites Work