A PTAS for minimizing weighted flow time on a single machine
From MaRDI portal
Publication:6499308
Cites work
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- scientific article; zbMATH DE number 7051295 (Why is no real title available?)
- A (2 + ε )-approximation algorithm for preemptive weighted flow time on a single machine
- A polynomial time constant approximation for minimizing total weighted flow-time
- Algorithms for minimizing weighted flow time
- Approximation algorithms for average stretch scheduling
- Approximation schemes for preemptive weighted flow time
- Constant factor approximation algorithm for weighted flow-time on a single machine in pseudopolynomial time
- Fixed-parameter approximation schemes for weighted flowtime
- LATIN 2004: Theoretical Informatics
- Minimizing weighted flow time
- Server scheduling in the L p norm
- The geometry of scheduling
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)
