Steiner Tree Problems in Telecommunications

Connecting a given set of points at minimum cost may be rated as one of the most important problems in telecommunications network design. Related questions may be formulated in metric spaces as well as in graphs. Given a weighted graph, the Steiner tree problem in graphs asks to determine a minimum cost subgraph spanning a set of specified vertices. This problem may be viewed as the combinatorial optimization problem in telecommunications. In this chapter, we survey Steiner problems from a telecommunications perspective with a special emphasis on the problem in graphs.

[1]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[2]  J. Plesník.  A bound for the Steiner tree problem in graphs , 1981 .

[3]  Abilio Lucena,et al.  A Branch and Cut Algorithm for the Steiner Problem in Graphs , 1998 .

[4]  Martin Zachariasen.  The Rectilinear Steiner Tree Problem: A Tutorial , 2001 .

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Stefan Voss,et al.  Steiner-Probleme in Graphen , 1990 .

[7]  Cristina Requejo,et al.  A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees , 2004 .

[8]  Celso C. Ribeiro,et al.  A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs , 2002, INFORMS J. Comput..

[9]  Mauricio G. C. Resende,et al.  Strong lower bounds for the prize collecting Steiner problem in graphs , 2004, Discret. Appl. Math..

[10]  Yossi Azar,et al.  On-line generalized Steiner problem , 1996, SODA '96.

[11]  T. Koch,et al.  Solving Steiner Tree Problems in Graphs to Optimality , 1998 .

[12]  C. W. Duin,et al.  HEURISTIC METHODS FOR THE RECTILINEAR STEINER ARBORESCENCE PROBLEM , 1993 .

[13]  Ján Plesník.  Heuristics for the Steiner Problem in Graphs , 1992, Discret. Appl. Math..

[14]  Daniel J. Kleitman,et al.  Cost allocation for a spanning tree , 1973, Networks.

[15]  Gorazd Kandus,et al.  Steiner Tree Based Distributed Multicast Routing in Networks , 2001 .

[16]  Siavash Vahdati Daneshmand,et al.  Improved algorithms for the Steiner problem in networks , 2001, Discret. Appl. Math..

[17]  William Sharkey,et al.  Network Models in Economics , 1991 .

[18]  Victor J. Rayward-Smith,et al.  On finding steiner vertices , 1986, Networks.

[19]  Billy E. Gillett,et al.  A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks , 1991, INFORMS J. Comput..

[20]  Michel X. Goemans,et al.  A catalog of steiner tree formulations , 1993, Networks.

[21]  M. R. Rao,et al.  Solving the Steiner Tree Problem on a Graph Using Branch and Cut , 1992, INFORMS J. Comput..

[22]  Sudipto Guha,et al.  Approximation algorithms for directed Steiner problems , 1999, SODA '98.

[23]  Anujan Varma,et al.  Degree-constrained multicasting in point-to-point networks , 1995, Proceedings of INFOCOM'95.

[24]  Dana S. Richards,et al.  Steiner tree problems , 1992, Networks.

[25]  Petra Mutzel,et al.  Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem , 2004, GECCO.

[26]  J. Steiner.  Lehrsätze und Aufgaben, erstere zu beweisen, letztere aufzulösen. , 1835 .

[27]  William W. Sharkey,et al.  Chapter 9 Network models in economics , 1995 .

[28]  Stefan Voß,et al.  Modern Heuristic Search Methods for the Steiner Tree Problem in Graphs , 2000 .

[29]  Stefan Voß,et al.  Worst-Case Performance of Some Heuristics for Steiner's Problem in Directed Graphs , 1993, Inf. Process. Lett..

[30]  Gilbert Laporte,et al.  Efficient heuristics for the design of ring networks , 1995, Telecommun. Syst..

[31]  David M. Warme,et al.  Exact Algorithms for Plane Steiner Tree Problems: A Computational Study , 2000 .

[32]  C. W. Duin.  Preprocessing the Steiner problem in graph , 2000 .

[33]  J. F. Weng.  Steiner Trees on Curved Surfaces , 2001, Graphs Comb..

[34]  Pawel Winter,et al.  Path-distance heuristics for the Steiner problem in undirected networks , 1992, Algorithmica.

[35]  Richard T. Wong,et al.  A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..

[36]  Panos M. Pardalos,et al.  A test problem generator for the Steiner problem in graphs , 1993, TOMS.

[37]  Kurt Mehlhorn,et al.  A Faster Approximation Algorithm for the Steiner Problem in Graphs , 1988, Inf. Process. Lett..

[38]  Stefan Voß,et al.  Solving General Ring Network Design Problems by Meta-Heuristics , 2000 .

[39]  M. Hanan,et al.  On Steiner’s Problem with Rectilinear Distance , 1966 .

[40]  Aravind Srinivasan,et al.  On the Covering Steiner Problem , 2003, FSTTCS.

[41]  Zevi Miller,et al.  The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem , 2005 .

[42]  Stefan Voß,et al.  A Star-Shaped Diversification Approach in Tabu Search , 1996 .

[43]  Alex Zelikovsky.  A Faster Approximation Algorithm for the Steiner Tree Problem in Graphs , 1993, Inf. Process. Lett..

[44]  Alex Zelikovsky,et al.  Improved Steiner tree approximation in graphs , 2000, SODA '00.

[45]  Stefan Voß,et al.  A chunking based genetic algorithm for the Steiner tree problem in graphs , 1997, Network Design: Connectivity and Facilities Location.

[46]  Z. A. Melzak,et al.  Steiner’s problem for set-terminals , 1968 .

[47]  Panos M. Pardalos,et al.  Encyclopedia of Optimization , 2006 .

[48]  Peter Widmayer,et al.  An Approximation Algorithms for Steiner's Problem in Graphs , 1986, WG.

[49]  Kun-Mao Chao,et al.  Spanning trees and optimization problems , 2004, Discrete mathematics and its applications.

[50]  Arie Segev,et al.  The node-weighted steiner tree problem , 1987, Networks.

[51]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[52]  Josep M. Basart,et al.  A High Performance Approximate Algorithm for the Steiner Problem in Graphs , 1998, RANDOM.

[53]  Alex Zelikovsky,et al.  A series of approximation algorithms for the acyclic directed steiner tree problem , 1997, Algorithmica.

[54]  Alex Zelikovsky,et al.  An 11/6-approximation algorithm for the network steiner problem , 1993, Algorithmica.

[55]  A. Volgenant,et al.  Reduction tests for the steiner problem in grapsh , 1989, Networks.

[56]  Makoto Imase,et al.  Dynamic Steiner Tree Problem , 1991, SIAM J. Discret. Math..

[57]  Stefan Voß,et al.  Steiner Tree Heuristics — A Survey , 1994 .

[58]  Piotr Berman,et al.  Improved approximations for the Steiner tree problem , 1992, SODA '92.

[59]  M. Gendreau,et al.  A tabu search heuristic for the Steiner Tree Problem , 1999, Networks.

[60]  Golden G. Richard,et al.  Distributed multicast tree generation with dynamic group membership , 2003, Comput. Commun..

[61]  Laura Bahiense,et al.  Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation , 2003, J. Comb. Optim..

[62]  Ding-Zhu Du.  An optimization problem on graphs , 1986, Discret. Appl. Math..

[63]  David S. Johnson,et al.  The prize collecting Steiner tree problem: theory and practice , 2000, SODA '00.

[64]  Celso C. Ribeiro,et al.  Improved Tabu Search For The Steiner Problem In Graphs , 2000 .

[65]  Yash P. Aneja,et al.  An integer linear programming approach to the steiner problem in graphs , 1980, Networks.

[66]  Victor J. Rayward-Smith,et al.  Modern Heuristic Search Methods , 1996 .

[67]  Prakash Mirchandani,et al.  The Multi-Tier Tree Problem , 1996, INFORMS J. Comput..

[68]  Béla Bollobás,et al.  On the Value of a Random Minimum Weight Steiner Tree , 2004, Comb..

[69]  Susan L. Albin,et al.  The design of centralized networks with reliability and availability constraints , 1988, Comput. Oper. Res..

[70]  Alfredo Candia-Véjar,et al.  Performance Analysis of Algorithms for the Steiner Problem in Directed Networks , 2004, Electron. Notes Discret. Math..

[71]  Juan-José Salazar-González.  The Steiner cycle polytope , 2003 .

[72]  Herbert Stögner,et al.  Simulation and Optimization of the Implementation Costs for the Last Mile of Fiber Optic Networks , 2003 .

[73]  Siavash Vahdati Daneshmand,et al.  A comparison of Steiner tree relaxations , 2001, Discret. Appl. Math..

[74]  H. T. Lau.  Steiner Tree Problem , 1986 .

[75]  S. Voss,et al.  The pilot method; a strategie of heuristic repetition with application to the Steiner problem in graphs , 1996 .

[76]  B. Gavish.  Topological design of computer communication networks — The overall design problem , 1992 .

[77]  R. Courant,et al.  What Is Mathematics , 1943 .

[78]  Henrik Esbensen,et al.  Computing near-optimal solutions to the steiner problem in a graph using a genetic algorithm , 1995, Networks.

[79]  R. Gary Parker,et al.  On multiple steiner subgraph problems , 1986, Networks.

[80]  Xiaohua Jia,et al.  A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem , 2002, J. Glob. Optim..

[81]  Stefan Voß,et al.  Steiner's Problem in Graphs: Heuristic Methods , 1992, Discret. Appl. Math..

[82]  A. Volgenant,et al.  Reducing the hierarchical network design problem , 1989 .

[83]  M. Minoux.  Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity , 1990 .

[84]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[85]  B. Gavish,et al.  Topological design of computer communication networks , 1989, [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track.

[86]  Choukhmane El-Arbi.  Une heuristique pour le problème de l'arbre de Steiner , 1978 .

[87]  Panos M. Pardalos,et al.  A heuristic for the Steiner problem in graphs , 1996, Comput. Optim. Appl..

[88]  Marek Karpinski,et al.  New Approximation Algorithms for the Steiner Tree Problems , 1997, J. Comb. Optim..

[89]  A. Volgenant,et al.  An edge elimination test for the steiner problem in graphs , 1989 .

[90]  Hans Jürgen Prömel,et al.  The Steiner Tree Problem , 2002 .

[91]  J. Steiner.  Aufgaben und Lehrsätze erstere aufzulösen, letztere zu beweisen. , 1827 .

[92]  Makoto Imase,et al.  Worst-Case Performance of Rayward-Smith's Steiner Tree Heuristic , 1988, Inf. Process. Lett..

[93]  Robert E. Tarjan,et al.  Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

[94]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[95]  Joseph Naor,et al.  Resource optimization in QoS multicast routing of real-time multimedia , 2004, IEEE/ACM Transactions on Networking.

[96]  S. Voß,et al.  The Steiner tree problem with hop constraints , 1999, Ann. Oper. Res..

[97]  R. Ravi,et al.  When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks , 1995, SIAM J. Comput..

[98]  Panos M. Pardalos,et al.  A survey of combinatorial optimization problems in multicast routing , 2005, Comput. Oper. Res..

[99]  Aravind Srinivasan,et al.  Cost-Sharing Mechanisms for Network Design , 2004, APPROX-RANDOM.

[100]  Anantaram Balakrishnan,et al.  Problem reduction methods and a tree generation algorithm for the steiner network problem , 1987, Networks.

[101]  D. Du,et al.  Advances in Steiner trees , 2000 .

[102]  J. Plesnik.  WORST-CASE RELATIVE PERFORMANCES OF HEURISTICS FOR THE STEINER PROBLEM IN GRAPHS , 1991 .

[103]  Celso C. Ribeiro,et al.  Local search with perturbations for the prize‐collecting Steiner tree problem in graphs , 2001, Networks.

[104]  S. Voß,et al.  Efficient path and vertex exchange in steiner tree algorithms , 1997 .

[105]  Celso C. Ribeiro,et al.  A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy , 2000, J. Glob. Optim..

[106]  Martin Zachariasen,et al.  Rectilinear group Steiner trees and applications in VLSI design , 2003, Math. Program..

[107]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[108]  J. E. Beasley.  An SST-based algorithm for the steiner problem in graphs , 1989, Networks.

[109]  J. Soukup,et al.  Set of test problems for the minimum length connection networks , 1973, SMAP.

[110]  Celso C. Ribeiro,et al.  New benchmark instances for the Steiner problem in graphs , 2004 .

[111]  Marek Karpinski,et al.  Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem , 2005, Algorithmica.

[112]  Edmund Ihler,et al.  Class Steiner Trees and VLSI-design , 1999, Discret. Appl. Math..

[113]  Alfredo Candia-Véjar,et al.  An approach for the Steiner problem in directed graphs , 1991, Ann. Oper. Res..

[114]  Moshe Dror,et al.  Generalized spanning trees , 2000, Eur. J. Oper. Res..

[115]  Goutam Chakraborty,et al.  A Distributed Routing Method for Dynamic Multicasting , 2004, Telecommun. Syst..

[116]  Hong-Hsu Yen,et al.  Near-optimal tree-based access network design , 2005, Comput. Commun..

[117]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[118]  Darko Skorin-Kapov.  On Cost Allocation in Steiner Tree Networks , 2001 .

[119]  Frank K. Hwang,et al.  The rectilinear steiner arborescence problem , 2005, Algorithmica.

[120]  Fred W. Glover,et al.  Using tabu search to solve the Steiner tree-star problem in telecommunications network design , 1996, Telecommun. Syst..

[121]  T. Koch,et al.  SteinLib: An Updated Library on Steiner Tree Problems in Graphs , 2001 .

[122]  V. J. Rayward-Smith,et al.  The computation of nearly minimal Steiner trees in graphs , 1983 .

[123]  Luís Gouveia,et al.  Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints , 1998, INFORMS J. Comput..

[124]  Stefan Voß,et al.  Solving group Steiner problems as Steiner problems , 2004, Eur. J. Oper. Res..

[125]  R. Ravi,et al.  Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems , 2004, Math. Program..