153 search results - page 17 / 31 » Approximating node connectivity problems via set covers |
154
click to vote
FOCS
2008
IEEE
15 years 12 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...
153
Voted
IPCO
2010
15 years 7 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
129
click to vote
ICOIN
2003
Springer
15 years 10 months ago
2003
Springer
As the Internet population grows, not only computers but household electric appliances, such as VCRs and a refrigerators, will become connected to a network. The demand of connecti...
138
click to vote
NIPS
2004
15 years 6 months ago
2004
We propose a novel a framework for deriving approximations for intractable probabilistic models. This framework is based on a free energy (negative log marginal likelihood) and ca...
172
click to vote
IWDC
2005
Springer
15 years 11 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...