Mixing times and ℓp bounds for Oblivious routing

DOI10.1137/1.9781611972993.10zbMath1430.90546OpenAlexW2494631047MaRDI QIDQ5194666

Gregory F. Lawler, Hariharan Narayanan

Publication date: 16 September 2019

Published in: 2009 Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611972993.10

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)

Related Items (3)

Randomized oblivious integral routing for minimizing power cost ⋮ Bayesian generalized network design ⋮ Unnamed Item

This page was built for publication: Mixing times and ℓ_p bounds for Oblivious routing