1671 search results - page 22 / 335 » On the Covering Steiner Problem |
IPL
2002
13 years 10 months ago
2002
The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation
COMPGEOM
1994
ACM
14 years 3 months ago
1994
ACM
For two given point sets, we present a very simple (almost trivial) algorithm to translate one set so that the Hausdor distance between the two sets is not larger than a constant ...
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
SOICT
2010
13 years 5 months ago
2010
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
ICCAD
2007
IEEE
14 years 7 months ago
2007
IEEE
— In this paper, we present the first work on the Steiner routing for 3D stacked ICs. In the 3D Steiner routing problem, the pins are located in multiple device layers, which ma...