Zeev Nutov

activity

20112026

most citedApproximating minimum-cost edge-covers of crossing biset-families

3 citations · 10 across the 18 of their papers we have counts for

collaborators

Showing 2011Show all

2 papers · 1 filter

cs.DS2011★ 1 cited

Approximating minimum-power edge-multicovers

Nachshon Cohen, Zeev Nutov

Given a graph with edge costs, the {\em power} of a node is themaximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by…

cs.DS2011

Approximating subset $k$ -connectivity problems

Zeev Nutov

A subset $T \subseteq V$ of terminals is $k$ -connected to a root $s$ in a directed/undirected graph $J$ if $J$ has $k$ internally-disjoint $v s$ -paths for every $v \in T$ ; $T$ is $k…

Approximating minimum-power edge-multicovers

Approximating subset k-connectivity problems

Approximating subset $k$ -connectivity problems