Approximation Schemes for Preemptive Weighted Flow Time

doi 10.1145/509953.509954
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

A Polynomial Time Constant Approximation for Minimizing Total Weighted Flow-Time

2019English

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
MathematicsComputer Science
2005English

Polynomial-Time Approximation Schemes for Scheduling Problems With Time Lags

Journal of Scheduling
Management ScienceEngineeringOperations ResearchArtificial IntelligenceSoftware
2009English

Approximation Schemes for the Min-Max Starting Time Problem

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2004English

Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2002English

Baker Game and Polynomial-Time Approximation Schemes

2020English

A Tight 2-Approximation for Preemptive Stochastic Scheduling

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2014English

Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1999English

Transmutation Techniques and Observability for Time-Discrete Approximation Schemes of Conservative Systems

Numerische Mathematik
Computational MathematicsApplied Mathematics
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy