Randomized oblivious integral routing for minimizing power cost

DOI10.1016/J.TCS.2015.07.007zbMATH Open1333.90143OpenAlexW828037862MaRDI QIDQ897952FDOQ897952

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

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

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

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)

Cites Work

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

Cited In (4)

• Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs
• Integer Programming and Combinatorial Optimization
• Title not available (Why is that?)
• Bayesian generalized network design

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)