We give a deterministic (global) min-cut algorithm for weighted undirected graphs that runs
in time O (m 1+ ε) plus polylog (n) max-flow computations. Using the current best max-flow …

IP fast reroute methods are used to recover packets in the data plane upon link failures.
Previous work provided methods that guarantee failure recovery from at most two-link …

We initiate the study of matroid problems in a new oracle model called dynamic oracle. Our
algorithms in this model lead to new bounds for some classic problems, and a “unified” …

The Gomory-Hu tree or cut tree (Gomory and Hu, 1961) is a classic data structure for
reporting s− t mincuts (and by duality, the values of s− t maxflows) for all pairs of vertices s …

Fast reroute and other forms of immediate failover have long been used to recover from
certain classes of failures without invoking the network control plane. While the set of such …

To provide fast traffic recovery upon failures, most modern networks support static Fast
Rerouting (FRR) mechanisms for mission critical services. However, configuring FRR …

Graph compression or sparsification is a basic information-theoretic and computational
question. A major open problem in this research area is whether (1+∊)-approximate cut …

To meet the stringent requirements on the maximally tolerable disruptions of traffic under link
failures, many communication networks feature some sort of static failover mechanism for …

We give an almost-linear time algorithm for the Steiner connectivity augmentation problem:
given an undirected graph, find a smallest (or minimum weight) set of edges whose addition …

Abstract We study the Static-Routing-Resiliency problem, motivated by routing on the
Internet: Given a graph G=(V, E), a unique destination vertex d, and an integer constant c> 0 …