Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time
From MaRDI portal
Publication:6139826
DOI10.1137/19M1244512OpenAlexW3090692263MaRDI QIDQ6139826FDOQ6139826
Authors: Jatin Batra, Naveen Garg, Amit Kumar 
Publication date: 19 December 2023
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/19m1244512
Cites Work
- Title not available (Why is that?)
- Speed is as powerful as clairvoyance
- Weighted geometric set cover via quasi-uniform sampling
- Title not available (Why is that?)
- A unified approach to approximating resource allocation and scheduling
- On column-restricted and priority covering integer programs
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
- 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
- Fair Scheduling via Iterative Quasi-Uniform Sampling
- On capacitated set cover problems
This page was built for publication: Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139826)
