Advertisement

A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems

  • Mario Ruthmair
  • Günther R. Raidl
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6655)

Abstract

We present a layered graph model for delay-constrained minimum tree problems with a polynomial number of constraints which can be solved well for instances with low- to medium-sized sets of achievable delay values and not too high bounds. Layered graph models have been recently shown to frequently yield tight bounds in the context of hop- or delay-constrained network design problems. However, since the size of the layered graph heavily depends on the size of the set of achievable delay values and the corresponding delay bound the practical applicability of these models is limited. To overcome this problem we introduce an iterative strategy in which an initially small layered graph is successively extended in order to tighten lower and upper bounds until convergence to the optimal solution. Computational results show the synergetic effectiveness of both approaches outperforming existing models in nearly all cases.

Keywords

Integer Linear Programming Layered Graph Steiner Tree Variable Neighborhood Search Linear Programming Relaxation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    de Aragão, M., Uchoa, E., Werneck, R.: Dual heuristics on the exact solution of large Steiner problems. Electronic Notes in Discrete Mathematics 7, 150–153 (2001)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1, 195–207 (1971)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Gouveia, L., Simonetti, L., Uchoa, E.: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. Mathematical Programming, pp. 1–26 (2010)Google Scholar
  4. 4.
    Gouveia, L.: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints. Informs Journal on Computing 10(2), 180–188 (1998)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Gouveia, L.: Using hop-indexed models for constrained spanning and Steiner tree models, pp. 21–32. Kluwer Academic Publishers, Dordrecht (1999)Google Scholar
  6. 6.
    Gouveia, L., Paias, A., Sharma, D.: Modeling and Solving the Rooted Distance-Constrained Minimum Spanning Tree Problem. Computers and Operations Research 35(2), 600–613 (2008)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Koch, T., Martin, A.: Solving Steiner tree problems in graphs to optimality. Networks 32(3), 207–232 (1998)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multicast routing for multimedia communication. IEEE / ACM Transactions on Networking 1(3), 286–292 (1993)CrossRefGoogle Scholar
  9. 9.
    Leggieri, V., Haouari, M., Triki, C.: An Exact Algorithm for the Steiner Tree Problem with Delays. Electronic Notes in Discrete Mathematics 36, 223–230 (2010)CrossRefMATHGoogle Scholar
  10. 10.
    Ljubic, I., Gollowitzer, S.: Modelling the hop constrained connected facility location problem on layered graphs. In: Electronic Notes in Discrete Mathematics, vol. 36, pp. 207–214. Elsevier, Amsterdam (2010)Google Scholar
  11. 11.
    Ljubic, I., Weiskircher, R., Pferschy, U., Klau, G., Mutzel, P., Fischetti, M.: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Mathematical Programming 105(2), 427–449 (2006)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Manyem, P., Stallmann, M.: Some approximation results in multicasting. Tech. Rep. TR-96-03, North Carolina State University (1996)Google Scholar
  13. 13.
    Nastansky, L., Selkow, S., Stewart, N.: Cost-minimal trees in directed acyclic graphs. Mathematical Methods of Operations Research 18(1), 59–67 (1974)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: SODA 2000: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pp. 770–779. Society for Industrial and Applied Mathematics (2000)Google Scholar
  15. 15.
    Ruthmair, M., Raidl, G.R.: A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) EUROCAST 2009. LNCS, vol. 5717, pp. 713–720. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  16. 16.
    Ruthmair, M., Raidl, G.R.: Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6239, pp. 391–400. Springer, Heidelberg (2010)Google Scholar
  17. 17.
    Xu, Y., Qu, R.: A GRASP approach for the Delay-constrained Multicast routing problem. In: Proceedings of the 4th Multidisplinary International Scheduling Conference (MISTA4), Dublin, Ireland, pp. 93–104 (2009)Google Scholar
  18. 18.
    Xu, Y., Qu, R.: A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems. Applied Intelligence, 1–13 (2010)Google Scholar
  19. 19.
    Zelikovsky, A.: A series of approximation algorithms for the acyclic directed Steiner tree problem. Algorithmica 18(1), 99–110 (1997)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Mario Ruthmair
    • 1
  • Günther R. Raidl
    • 1
  1. 1.Institute of Computer Graphics and AlgorithmsVienna University of TechnologyViennaAustria

Personalised recommendations