Randomized oblivious integral routing for minimizing power cost

DOI10.1016/J.TCS.2015.07.007MaRDI QIDQ897952zbMATH OpenOpenAlexFDO

Authors Yangguang Shi, Fa Zhang, Jie Wu, 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

randomized algorithmenergy efficiencycompetitive ratiooblivious routingintegral routing

Mathematics Subject Classification ID

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

Recommendations

• Oblivious integral routing for minimizing the quadratic polynomial cost
• Oblivious routing in directed graphs with random demands
• Hardness of routing for minimizing superlinear polynomial cost in directed graphs
• Oblivious routing on node-capacitated and directed graphs
• Oblivious routing on node-capacitated and directed graphs

Cites work

• scientific article; zbMATH DE number 5485537 (Why is no real title available?)
• scientific article; zbMATH DE number 5764851 (Why is no real title available?)
• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• scientific article; zbMATH DE number 1460605 (Why is no real title available?)
• scientific article; zbMATH DE number 6783411 (Why is no real title available?)
• scientific article; zbMATH DE number 3052523 (Why is no real title available?)
• A Scheme for Fast Parallel Communication
• A tight bound on approximating arbitrary metrics by tree metrics
• Eigenvalues and expanders
• Electric routing and concurrent flow cutting
• Energy efficient scheduling and routing via randomized rounding
• Expander graphs and their applications
• Improved bounds on Bell numbers and on moments of sums of random variables
• Mixing times and \(\ell_p\) bounds for oblivious routing
• Network flows. Theory, algorithms, and applications.
• Oblivious Routing for the Lp-norm
• Oblivious integral routing for minimizing the quadratic polynomial cost
• Oblivious network design
• Online primal-dual for non-linear optimization with applications to speed scaling
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Solving Optimization Problems with Diseconomies of Scale via Decoupling
• Survey on oblivious routing strategies

Cited in

(5)

• Bayesian generalized network design
• Bayesian generalized network design
• Integer Programming and Combinatorial Optimization
• Oblivious integral routing for minimizing the quadratic polynomial cost
• Hardness of routing for minimizing superlinear polynomial cost in directed graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897952)