412 search results - page 1 / 83 » Single-Sink Network Design with Vertex Connectivity Requirem... |
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
FOCS
2009
IEEE
13 years 8 months ago
2009
IEEE
ESA
2008
Springer
13 years 6 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...