Green scheduling, flows and matchings☆
Under an Elsevier user license
open archive
Keywords
Speed-scaling
Polynomial-time algorithms
Convex cost flows
Weighted matchings
Cited by (0)
- ☆
A preliminary version of this work has been published in the Proceedings of 23rd International Symposium on Algorithms and Computation (ISAAC 2012).
Copyright © 2015 Elsevier B.V. All rights reserved.