Randomized oblivious integral routing for minimizing power cost

DOI10.1016/j.tcs.2015.07.007zbMath1333.90143OpenAlexW828037862MaRDI QIDQ897952

Yangguang Shi, Jie Wu, Fa Zhang, Zhi-yong Liu

Publication date: 8 December 2015

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

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

zbMATH Keywords

competitive ratiorandomized algorithmoblivious routingenergy efficiencyintegral routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Randomized algorithms (68W20)

Related Items (3)

Bayesian generalized network design ⋮ Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Electric routing and concurrent flow cutting
• Dynamic vs. oblivious routing in network design
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Eigenvalues and expanders
• Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling
• Oblivious Integral Routing for Minimizing the Quadratic Polynomial Cost
• Expander graphs and their applications
• Survey on Oblivious Routing Strategies
• Oblivious network design
• A Scheme for Fast Parallel Communication
• Solving Optimization Problems with Diseconomies of Scale via Decoupling
• Oblivious Routing for the Lp-norm
• Mixing times and ℓ_p bounds for Oblivious routing
• A tight bound on approximating arbitrary metrics by tree metrics

This page was built for publication: Randomized oblivious integral routing for minimizing power cost