Randomized oblivious integral routing for minimizing power cost
type: Item
instance of: scholarly article
title: Randomized oblivious integral routing for minimizing power cost
zbMATH Open document ID: 1333.90143
author: Yangguang Shi
author: Fa Zhang
author: Jie Wu
author: Zhi-Yong Liu
published in: Theoretical Computer Science
publication date: 2015-12-08T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 6517480
zbMATH Keywords: oblivious routing
zbMATH Keywords: integral routing
zbMATH Keywords: randomized algorithm
zbMATH Keywords: competitive ratio
zbMATH Keywords: energy efficiency
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.07.007
OpenAlex ID: W828037862
cites work: Q3056948
cites work: Eigenvalues and expanders
cites work: Q2963934
cites work: Q3003675
cites work: Q5365059
cites work: Q3706275
cites work: Oblivious Routing for the Lp-norm
cites work: A tight bound on approximating arbitrary metrics by tree metrics
cites work: Dynamic vs. oblivious routing in network design
cites work: Oblivious network design
cites work: Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling
cites work: Q3579444
cites work: Expander graphs and their applications
cites work: Electric routing and concurrent flow cutting
cites work: Mixing times and ℓp bounds for Oblivious routing
cites work: Solving Optimization Problems with Diseconomies of Scale via Decoupling
cites work: Q4485695
cites work: Q3549709
cites work: Survey on Oblivious Routing Strategies
cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs
cites work: Oblivious Integral Routing for Minimizing the Quadratic Polynomial Cost
cites work: Q5791768
cites work: A Scheme for Fast Parallel Communication
DOI: 10.1016/J.TCS.2015.07.007
description: scientific article; zbMATH DE number 6517480