Green scheduling, flows and matchings

DOI10.1016/j.tcs.2015.02.020zbMath1312.68030MaRDI QIDQ2344761

Dimitrios Letsios, Evripidis Bampis, Giorgio Lucarelli

Publication date: 18 May 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.02.020

zbMATH Keywords

polynomial-time algorithms; speed-scaling; weighted matchings; convex cost flows

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68Q25: Analysis of algorithms and problem complexity

68W05: Nonnumerical algorithms

90B35: Deterministic scheduling theory in operations research

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

05C21: Flows in graphs