Zeev Nutov

activity

20112026

most citedOn the Tree Augmentation Problem

12 citations · 32 across the 31 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.DS2021

$k$ disjoint $s t$ -paths activation in polynomial time

Zeev Nutov

In activation network design problems we are given an undirected graph $G = (V, E)$ and a pair of activation costs ${c_{e}^{u}, c_{e}^{v}}$ for each $e = uv \in E$ . The goal is to find an edge…

cs.DS2021

Data structure for node connectivity and cut queries

Zeev Nutov

Let $κ (s, t)$ denote the maximum number of internally disjoint $s t$ -paths in an undirected graph $G$ . We consider designing a compact data structure that answers $k$ -bounded node co…

k disjoint st-paths activation in polynomial time

Data structure for node connectivity and cut queries

$k$ disjoint $s t$ -paths activation in polynomial time