Solving Optimization Problems with Diseconomies of Scale via Decoupling

DOI10.1145/3266140zbMath1426.90261OpenAlexW2901610206MaRDI QIDQ4625663

Konstantin Makarychev, M. I. Sviridenko

Publication date: 25 February 2019

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3266140

zbMATH Keywords

optimizationapproximation algorithmsenergy-efficient schedulingenergy-efficient routing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (8)

Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion ⋮ Randomized oblivious integral routing for minimizing power cost ⋮ The price of independence in a model with unknown dependence ⋮ Bayesian generalized network design ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Simpler and Better Algorithms for Minimum-Norm Load Balancing ⋮ Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines

This page was built for publication: Solving Optimization Problems with Diseconomies of Scale via Decoupling