3 search results - page 1 / 1 » Iterative rounding 2-approximation algorithms for minimum-co... |
JCSS
2006
14 years 5 months ago
2006
FOCS
2008
IEEE
14 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...
STOC
2007
ACM
15 years 5 months ago
2007
ACM
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...