Armbruster, A., Rohwedder, L., & Wiese, A. (2025). A $(2+\varepsilon)$-approximation algorithm for the general scheduling problem in quasipolynomial time.
Cita Chicago Style (17a ed.)Armbruster, Alexander, Lars Rohwedder, y Andreas Wiese. A $(2+\varepsilon)$-approximation Algorithm for the General Scheduling Problem in Quasipolynomial Time. 2025.
Cita MLA (9a ed.)Armbruster, Alexander, et al. A $(2+\varepsilon)$-approximation Algorithm for the General Scheduling Problem in Quasipolynomial Time. 2025.
Precaución: Estas citas no son 100% exactas.