446 search results - page 12 / 90 » A fast algorithm for computing steiner edge connectivity |
82
Voted
AAAI
2011
13 years 9 months ago
2011
The conservation of wildlife corridors between existing habitat preserves is important for combating the effects of habitat loss and fragmentation facing species of concern. We in...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
VISUALIZATION
1999
IEEE
15 years 1 months ago
1999
IEEE
Many applications produce three-dimensional points that must be further processed to generate a surface. Surface reconstruction algorithms that start with a set of unorganized poi...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
ICOIN
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...