Electric routing and concurrent flow cutting
type: Item
instance of: scholarly article
title: Electric routing and concurrent flow cutting
zbMATH Open document ID: 1221.68172
author: Petar Maymounkov
author: Jonathan Kelner
published in: Theoretical Computer Science
publication date: 2011-07-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M11
zbMATH DE Number: 5932528
zbMATH Keywords: oblivious routing
zbMATH Keywords: spectral graph theory
zbMATH Keywords: Laplacian operator
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.06.013
OpenAlex ID: W2570775423
cites work: Compact name-independent routing with minimum stretch
cites work: Open problems of Paul Erd�s in graph theory
cites work: Q4709170
cites work: Q4633869
cites work: New lower bounds for oblivious routing in undirected graphs
cites work: Q3579444
cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
cites work: Q3549709
cites work: Q5302080
cites work: Approximate distance oracles
DOI: 10.1016/J.TCS.2010.06.013
description: scientific article; zbMATH DE number 5932528