INFORMATICALT
2000
13 years 4 months ago
2000
The result of simulation of an idealized thin wet film connecting fixed points in the Euclidean plane is a length-minimizing curve. Gradually increasing the exterior pressure we ar...
ORL
2006
13 years 4 months ago
2006
This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction test...
FSTTCS
2003
Springer
13 years 9 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
ISAAC
2004
Springer
13 years 9 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
ICPADS
2007
IEEE
13 years 10 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...