In the Activation Edge-Multicover problem we are given a multigraph G=(V...
In the Activation k Disjoint st-Paths (Activation k-DP)
problem we are g...
A set family F is uncrossable if A ∩ B,A ∪ B ∈ F
or A ∖ B,B ∖ A ∈ F for ...
We consider the following two variants of the Capacitated k-Edge Connect...
One of the most important and well-studied settings for network design i...
A graph G is k-out-connected from its node s if it contains k
internally...
In minimum power network design problems we are given an undirected grap...
In activation network design problems we are given an undirected graph
G...
Let κ(s,t) denote the maximum number of internally disjoint paths in
an ...
In Connectivity Augmentation problems we are given a graph H=(V,E_H) and...
We consider the directed Rooted Subset k-Edge-Connectivity problem: give...
We consider the Budgeted Submodular Maximization problem, that seeks to
...
We consider network design problems in which we are given a graph G=(V,E...
In the Connected Dominating Set problem we are given a graph G=(V,E) and...
We study two problems that seek a subtree T of a graph G=(V,E) such that...
A subset S of nodes in a graph G is a k-connected m-dominating set
((k,m...
We obtain approximation ratio 2(2+1/ℓ) for the (undirected)
k-Connected ...
What approximation ratio can we achieve for the Facility Location proble...