Multicast Routing for Energy Minimization Using Speed Scaling

DOI10.1007/978-3-642-34862-4_3zbMath1383.68009OpenAlexW2146957782MaRDI QIDQ4916030

Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, Clifford Stein, Kirk R. Pruhs

Publication date: 19 April 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-34862-4_3

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (3)

The matroid intersection cover problem ⋮ Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs ⋮ Hallucination Helps: Energy Efficient Virtual Circuit Routing

This page was built for publication: Multicast Routing for Energy Minimization Using Speed Scaling