Polynomial-Time Approximation Schemes for Scheduling Problems With Time Lags

Journal of Scheduling - United States
doi 10.1007/s10951-009-0134-8
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

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

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

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
MathematicsComputer Science
2005English

Baker Game and Polynomial-Time Approximation Schemes

2020English

Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems.

2013English

Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2002English

Approximation Schemes for Preemptive Weighted Flow Time

2002English

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

2019English

Polynomial Time Algorithms for Scheduling of Arrival Aircraft

2005English

Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in H-Free Graphs

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy