Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency

DOI10.1145/3377387zbMath1455.68029arXiv1803.05361OpenAlexW3004444832MaRDI QIDQ5133963

Yuval Emek, Ron Lavi, Shay Kutten, Yangguang Shi

Publication date: 11 November 2020

Published in: Journal of the ACM, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.05361

zbMATH Keywords

smoothnessapproximation algorithmsenergy consumptiongeneralized network designbest response dynamics(dis)economies of scalereal exponent polynomial cost functions

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Related Items (3)

Stackelberg pricing games with congestion effects ⋮ Bayesian generalized network design ⋮ Unnamed Item

This page was built for publication: Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency