Fixed-Parameter Approximation Schemes for Weighted Flowtime.

DOI10.4230/LIPIcs.APPROX-RANDOM.2018.28OpenAlexW2889246377MaRDI QIDQ5009522

Andreas Wiese

Publication date: 4 August 2021

Full work available at URL: https://research.vu.nl/en/publications/fixed-parameter-approximation-schemes-for-weighted-flowtime

zbMATH Keywords

schedulingapproximation schemesapproximation algorithmsfixed-parameter algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient polynomial time approximation scheme for load balancing on uniformly related machines
• Scheduling and fixed-parameter tractability
• Scheduling meets \(n\)-fold integer programming
• Approximation schemes for preemptive weighted flow time
• Minimizing Total Flow-Time: The Unrelated Case
• Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
• A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time
• Algorithms for minimizing weighted flow time

This page was built for publication: Fixed-Parameter Approximation Schemes for Weighted Flowtime.