Two new efficient approximation algorithms with O(k log k) for the Steiner tree problem in rectilinear graphs

2002 ◽  
Author(s):  
T. Matsumoto ◽  
T. Takahata ◽  
K. Tsuji
Keyword(s):  
Approximation Algorithms ◽  
Steiner Tree ◽  
Steiner Tree Problem ◽  
Efficient Approximation

Approximation Algorithms for the Steiner Tree Problem in Graphs

2001 ◽  
pp. 235-279 ◽  
Author(s):  
Clemens Gröpl ◽  
Stefan Hougardy ◽  
Till Nierhoff ◽  
Hans Jürgen Prömel
Keyword(s):  
Approximation Algorithms ◽  
Steiner Tree ◽  
Steiner Tree Problem

Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem

2019 ◽  
Vol 39 (2) ◽  
pp. 492-508 ◽  
Author(s):  
Jianping Li ◽  
Suding Liu ◽  
Junran Lichen ◽  
Wencheng Wang ◽  
Yujie Zheng
Keyword(s):  
Approximation Algorithms ◽  
Steiner Tree ◽  
Steiner Tree Problem ◽  
Minimum Steiner Tree ◽  
Minimum Steiner Tree Problem

scholarly journals Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem

2007 ◽  
Vol 103 (5) ◽  
pp. 195-202 ◽  
Author(s):  
Paulo Feofiloff ◽  
Cristina G. Fernandes ◽  
Carlos E. Ferreira ◽  
José Coelho de Pina
Keyword(s):  
Approximation Algorithms ◽  
Steiner Tree ◽  
Steiner Tree Problem ◽  
Primal Dual ◽  
Prize Collecting
Sign in / Sign up

Export Citation Format

Share Document