1671 search results - page 4 / 335 » On the Covering Steiner Problem |
SODA
1992
ACM
13 years 11 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
ORL
2007
13 years 9 months ago
2007
CCCG
2007
13 years 11 months ago
2007
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...
CCCG
2008
13 years 11 months ago
2008
We consider the problem of finding a shortest rectilinear Steiner tree for a given set of points in the plane in the presence of rectilinear obstacles that must be avoided. We ext...