Zeev Nutov

Approximating Node Connectivity Problems via Set Covers

Abstract Given a graph (directed or undirected) with costs on the edges, and an integer

A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph

k

Approximation algorithms and hardness results for cycle packing problems

, we consider the problem of finding a

Approximating Steiner Networks with Node-Weights

k

Approximating k -node Connected Subgraphs via Critical Graphs

-node connected spanning subgraph of minimum cost. For the general instance of the problem (directed or undirected), there is a simple

Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions

2k

Approximating minimum-cost connectivity problems via uncrossable bifamilies

-approximation algorithm. Better algorithms are known for various ranges of

A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs

n,k

Novel algorithms for the network lifetime problem in wireless settings

. For undirected graphs with metric costs Khuller and Raghavachari gave a

Inapproximability of survivable networks

( 2+{2(k-1)}/{n})