1671 search results - page 50 / 335 » On the Covering Steiner Problem |
MP
2010
14 years 11 months ago
2010
CORR
2010
Springer
14 years 10 months ago
2010
Springer
COCOA
2007
Springer
15 years 7 months ago
2007
Springer
We consider the problem of connecting given vertex pairs over a stochastic metric graph, each vertex of which has a probability of presence independently of all other ver
120
Voted
SODA
1992
ACM
15 years 2 months ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
126
click to vote
COMGEO
2006
ACM
15 years 1 months ago
2006
ACM
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...