Zusammenfassung
Der Begriff des Zusammenhangs ist ein sehr wichtiger in der kombinatorischen Optimierung. In Kapitel 8 haben wir gezeigt,wie man den Zusammenhang zwischen jedem Knotenpaar eines ungerichteten Graphen berechnen kann. Hier interessieren wir uns für Teilgraphen, die gewisse Zusammenhangsbedingungen erfüllen.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literatur
Allgemeine Literatur
Cheng, X., und Du, D.-Z.: Steiner Trees in Industry. Kluwer, Dordrecht 2001
Du, D.-Z., Smith, J.M., und Rubinstein, J.H.: Advances in Steiner Trees. Kluwer, Boston 2000
Hwang, F.K., Richards, D.S., und Winter, P.: The Steiner Tree Problem; Annals of Discrete Mathematics 53. North-Holland, Amsterdam 1992
Goemans, M.X., und Williamson, D.P.: The primal-dual method for approximation algorithms and its application to network design problems. In: Approximation Algorithms for NP-Hard Problems. (D.S. Hochbaum, Hrsg.), PWS, Boston, 1996
Grötschel, M., Monma, C.L., und Stoer, M.: Design of survivable networks. In: Handbooks in Operations Research and Management Science; Volume 7; Network Models (M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser, Hrsg.), Elsevier, Amsterdam 1995
Kerivin, H., und Mahjoub, A.R.: Design of survivable networks: a survey. Networks 46 (2005), 1–21
Prömel, H.J., und Steger, A.: The Steiner Tree Problem. Vieweg, Braunschweig 2002
Stoer, M.: Design of Survivable Networks. Springer, Berlin 1992
Vazirani, V.V.: Approximation Algorithms. Springer, Berlin 2001, Kapitel 22 und 23
Zitierte Literatur
Agrawal, A., Klein, P.N., und Ravi, R.: When trees collide: an approximation algorithm for the generalized Steiner tree problem in networks. SIAM Journal on Computing 24 (1995), 440–456
Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM 45 (1998), 753–782
Berman, P., und Ramaiyer, V.: Improved approximations for the Steiner tree problem. Journal of Algorithms 17 (1994), 381–408
Bern, M., und Plassmann, P.: The Steiner problem with edge lengths 1 and 2. Information Processing Letters 32 (1989), 171–176
Bertsimas, D., und Teo, C.: From valid inequalities to heuristics: a unified view of primal-dual approximation algorithms in covering problems. Operations Research 46 (1998), 503–514
Bertsimas, D., und Teo, C.: The parsimonious property of cut covering problems and its applications. Operations Research Letters 21 (1997), 123–132
Borchers, A., und Du, D.-Z.: The k-Steiner ratio in graphs. SIAM Journal on Computing 26 (1997), 857–869
Borradaile, G., Kenyon-Mathieu, C., und Klein, P.: A polynomial-time approximation scheme for Steiner tree in planar graphs. Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (2007), 1285–1294
Cheriyan, J., und Vetta, A.: Approximation algorithms for network design with metric costs. SIAM Journal on Discrete Mathematics 21 (2007), 612–636
Choukhmane, E.: Une heuristique pour le problème de l’arbre de Steiner. RAIRO Recherche Opérationnelle 12 (1978), 207–212 [in French]
Clementi, A.E.F., und Trevisan, L.: Improved non-approximability results for minimum vertex cover with density constraints. Theoretical Computer Science 225 (1999), 113–128
Dreyfus, S.E., und Wagner, R.A.: The Steiner problem in graphs. Networks 1 (1972), 195–207
Du, D.-Z., Zhang, Y., und Feng, Q.: On better heuristic for Euclidean Steiner minimum trees. Proceedings of the 32nd Annual Symposium on the Foundations of Computer Science (1991), 431–439
Erickson, R.E., Monma, C.L., und Veinott, A.F., Jr.: Send-and-split method for minimum concave-cost network flows. Mathematics of Operations Research 12 (1987), 634–664
Fleischer, L., Jain, K., und Williamson, D.P.: Iterative rounding 2-approximation algorithms minimum-cost vertex connectivity problems. Journal of Computer and System Sciences 72 (2006), 838–867
Fuchs, B., Kern, W., Mölle, D., Richter, S., Rossmanith, P., und Wang, X.: Dynamic programming for minimum Steiner trees. Theory of Computing Systems 41 (2007), 493–500
Gabow, H.N.: An improved analysis for approximating the smallest k-edge connected spanning subgraph of a multigraph. SIAM Journal on Discrete Mathematics 19 (2005), 1–18
Gabow, H.N., Goemans, M.X., und Williamson, D.P.: An efficient approximation algorithm for the survivable network design problem. Mathematical Programming B 82 (1998), 13–40
Gabow, H.N., Goemans, M.X., Tardos, É., und Williamson, D.P.: Approximating the smallest k-edge connected spanning subgraph by LP-rounding. Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (2005), 562–571
Garey, M.R., Graham, R.L., und Johnson, D.S.: The complexity of computing Steiner minimal trees. SIAM Journal of Applied Mathematics 32 (1977), 835–859
Garey, M.R., und Johnson, D.S.: The rectilinear Steiner tree problem is NP-complete. SIAM Journal on Applied Mathematics 32 (1977), 826–834
Gilbert, E.N., und Pollak, H.O.: Steiner minimal trees. SIAM Journal on Applied Mathematics 16 (1968), 1–29
Goemans, M.X., und Bertsimas, D.J.: Survivable networks, linear programming and the parsimonious property, Mathematical Programming 60 (1993), 145–166
Goemans, M.X., Goldberg, A.V., Plotkin, S., Shmoys, D.B., Tardos, É., und Williamson, D.P.: Improved approximation algorithms for network design problems. Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (1994), 223–232
Goemans, M.X., und Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM Journal on Computing 24 (1995), 296–317
Gröpl, C., Hougardy, S., Nierhoff, T., und Prömel, H.J.: Approximation algorithms for the Steiner tree problem in graphs. In: Cheng und Du [2001], S. 235–279
Hanan, M.: On Steiner’s problem with rectilinear distance. SIAM Journal on Applied Mathematics 14 (1966), 255–265
Hetzel, A.: Verdrahtung im VLSI-Design: Spezielle Teilprobleme und ein sequentielles Lösungsverfahren. Dissertation, Universität Bonn, 1995
Hougardy, S., und Prömel, H.J.: A 1.598 approximation algorithm for the Steiner tree problem in graphs. Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (1999), 448–453
Hwang, F.K.: On Steiner minimal trees with rectilinear distance. SIAM Journal on Applied Mathematics 30 (1976), 104–114
Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21 (2001), 39–60
Jothi, R., Raghavachari, B., und Varadarajan, S.: A 5/4-approximation algorithm for minimum 2-edge-connectivity. Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (2003), 725–734
Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations (R.E. Miller, J.W. Thatcher, Hrsg.), Plenum Press, New York 1972, S. 85–103
Karpinski, M., und Zelikovsky, A.: New approximation algorithms for Steiner tree problems. Journal of Combinatorial Optimization 1 (1997), 47–65
Khuller, S., und Raghavachari, B.: Improved approximation algorithms for uniform connectivity problems. Journal of Algorithms 21 (1996), 434–450
Khuller, S., und Vishkin, U.: Biconnectivity augmentations and graph carvings. Journal of the ACM 41 (1994), 214–235
Klein, P.N., und Ravi, R.: When cycles collapse: a general approximation technique for constrained two-connectivity problems. Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference (1993), 39–55
Korte, B., Prömel, H.J., und Steger, A.: Steiner trees in VLSI-layout. In: Paths, Flows, and VLSI-Layout (B. Korte, L. Lovász, H.J. Prömel, A. Schrijver, Hrsg.), Springer, Berlin 1990, S. 185–214
Kortsarz, G., Krauthgamer, R., und Lee, J.R.: Hardness of approximation for vertexconnectivity network design problems. SIAM Journal on Computing 33 (2004), 704–720
Kou, L.: A faster approximation algorithm for the Steiner problem in graphs. Acta Informatica 27 (1990), 369–380
Kou, L., Markowsky, G., und Berman, L.: A fast algorithm for Steiner trees. Acta Informatica 15 (1981), 141–145
Martin, A.: Packen von Steinerbäumen: Polyedrische Studien und Anwendung. Ph.D. thesis, Technical University of Berlin 1992 [in German]
Mehlhorn, K.: A faster approximation algorithm for the Steiner problem in graphs. Information Processing Letters 27 (1988), 125–128
Melkonian, V., und Tardos, É.: Algorithms for a network design problem with crossing supermodular demands. Networks 43 (2004), 256–265
Robins, G., und Zelikovsky, A.: Tighter bounds for graph Steiner tree approximation. SIAM Journal on Discrete Mathematics 19 (2005), 122–134
Takahashi, M., und Matsuyama, A.: An approximate solution for the Steiner problem in graphs. Mathematica Japonica 24 (1980), 573–577
Thimm, M.: On the approximability of the Steiner tree problem. Theoretical Computer Science 295 (2003), 387–402
Warme, D.M., Winter, P., und Zachariasen, M.: Exact algorithms for plane Steiner tree problems: a computational study. In: Advances in Steiner trees (D.-Z. Du, J.M. Smith, J.H. Rubinstein, Hrsg.), Kluwer Academic Publishers, Boston, 2000, S. 81–116
Williamson, D.P., Goemans, M.X., Mihail, M., und Vazirani, V.V.: A primal-dual approximation algorithm for generalized Steiner network problems. Combinatorica 15 (1995), 435–454
Zelikovsky, A.Z.: An 11/6-approximation algorithm for the network Steiner problem. Algorithmica 9 (1993), 463–470
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Netzwerk-Design-Probleme. In: Kombinatorische Optimierung. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76919-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-76919-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76918-7
Online ISBN: 978-3-540-76919-4
eBook Packages: Life Science and Basic Disciplines (German Language)