3 search results - page 1 / 1 » Iterative rounding 2-approximation algorithms for minimum-co... |
62
Voted
JCSS
2006
15 years 16 days ago
2006
106
Voted
FOCS
2008
IEEE
15 years 7 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...
157
Voted
STOC
2007
ACM
16 years 27 days 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...