1671 search results - page 50 / 335 » On the Covering Steiner Problem |
MP
2010
13 years 9 months ago
2010
CORR
2010
Springer
13 years 8 months ago
2010
Springer
COCOA
2007
Springer
14 years 5 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
SODA
1992
ACM
14 years 5 days 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...
COMGEO
2006
ACM
13 years 11 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...