Electric routing and concurrent flow cutting

DOI10.1007/978-3-642-10631-6_80MaRDI QIDQ3652265zbMATH OpenOpenAlexFDO

Authors Jonathan Kelner, Petar Maymounkov

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/115843

Mathematics Subject Classification ID

Internet topics (68M11) Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Electric routing and concurrent flow cutting
• Localization of electrical flows
• Mixing times and \(\ell_p\) bounds for oblivious routing
• A new approach to computing maximum flows using electrical flows
• Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts

Cited in

(3)

• Localization of electrical flows
• Mixing times and \(\ell_p\) bounds for oblivious routing
• Electric routing and concurrent flow cutting

This page was built for publication: Electric routing and concurrent flow cutting

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