منابع مشابه
Lecture 1: Low-stretch trees
The main theme of the workshop is fast algorithms, particularly those that relate to fast solvers for linear systems involving the Laplacian of a graph. In my lectures, I will discuss three key technical ingredients that underlie those solvers. In this first lecture, I will discuss “low-stretch trees”. Given a graph, the goal is to find a spanning subtree such that, on average, distances in the...
متن کاملLocal Fast Failover Routing With Low Stretch
Network failures are frequent and disruptive, and can significantly reduce the throughput even in highly connected and regular networks such as datacenters. While many modern networks support some kind of local fast failover to quickly reroute flows encountering link failures to new paths, employing such mechanisms is known to be non-trivial, as conditional failover rules can only depend on loc...
متن کاملCertification of Compact Low-Stretch Routing Schemes
On the one hand, the correctness of routing protocols in networks is an issue of utmost importance for guaranteeing the delivery of messages from any source to any target. On the other hand, a large collection of routing schemes have been proposed during the last two decades, with the objective of transmitting messages along short routes, while keeping the routing tables small. Regrettably, all...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Anesthesiology
سال: 2020
ISSN: 0003-3022
DOI: 10.1097/aln.0000000000003244