Sciweavers

3 search results - page 1 / 1
» Iterative rounding 2-approximation algorithms for minimum-co...
Sort
View
FOCS
2008
IEEE
14 years 5 months ago
Algorithms for Single-Source Vertex Connectivity
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...
Julia Chuzhoy, Sanjeev Khanna
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
14 years 11 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau