A PTAS for minimizing weighted flow time on a single machine
From MaRDI portal
Publication:6499308
DOI10.1145/3564246.3585146MaRDI QIDQ6499308FDOQ6499308
Authors: Alexander Armbruster, Lars Rohwedder, Andreas Wiese 
Publication date: 8 May 2024
Cites Work
- Title not available (Why is that?)
- Server scheduling in the L p norm
- LATIN 2004: Theoretical Informatics
- Minimizing weighted flow time
- Algorithms for minimizing weighted flow time
- Approximation algorithms for average stretch scheduling
- Approximation schemes for preemptive weighted flow time
- The geometry of scheduling
- Title not available (Why is that?)
- A polynomial time constant approximation for minimizing total weighted flow-time
- Constant factor approximation algorithm for weighted flow-time on a single machine in pseudopolynomial time
- A (2 + ε )-approximation algorithm for preemptive weighted flow time on a single machine
- Fixed-parameter approximation schemes for weighted flowtime
This page was built for publication: A PTAS for minimizing weighted flow time on a single machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499308)
