Skip to main content
SpringerLink
Log in
Book cover

Kombinatorische Optimierung pp 141–166Cite as

Aufspannende Bäume und Arboreszenzen

  • Chapter
  • First Online:

  • 6223 Accesses

Part of the book series: Masterclass ((MASTERCLASS))

Zusammenfassung

Wir betrachten die wichtigen Probleme, optimale aufspannende Bäume und Arboreszenzen zu finden.

Neben effizienten Algorithmen betrachten wir auch Beschreibungen als lineare Programme und behandeln das Packen von Bäumen.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

Allgemeine Literatur:

  • Ahuja, R.K., Magnanti, T.L., und Orlin, J.B. [1993]: Network Flows. Prentice-Hall, Englewood Cliffs 1993, Kapitel 13

    Google Scholar 

  • Balakrishnan, V.K. [1995]: Network Optimization. Chapman and Hall, London 1995, Kapitel 1

    Google Scholar 

  • Cormen, T.H., Leiserson, C.E., Rivest, R.L., und Stein, C. [2009]: Introduction to Algorithms. 3. Aufl. MIT Press, Cambridge 2009, Kapitel 23

    Google Scholar 

  • Gondran, M., und Minoux, M. [1984]: Graphs and Algorithms. Wiley, Chichester 1984, Kapitel 4

    Google Scholar 

  • Magnanti, T.L., und Wolsey, L.A. [1995]: Optimal trees. 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, pp. 503–616

    Google Scholar 

  • Schrijver, A. [2003]: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin 2003, Chapters 50–53

    Google Scholar 

  • Tarjan, R.E. [1983]: Data Structures and Network Algorithms. SIAM, Philadelphia 1983, Kapitel 6

    Google Scholar 

  • Wu, B.Y., und Chao, K.-M. [2004]: Spanning Trees and Optimization Problems. Chapman & Hall/CRC, Boca Raton 2004

    Book  Google Scholar 

Zitierte Literatur:

  • Bock, F.C. [1971]: An algorithm to construct a minimum directed spanning tree in a directed network. In: Avi-Itzhak, B. (Hrsg.): Developments in Operations Research, Volume 1. Gordon and Breach, New York 1971, pp. 29–44

    Google Scholar 

  • Borůuvka, O. [1926a]: O jistém problému minimálním. Práca Moravské Přírodovědecké Spolnečnosti 3 (1926), 37–58 [auf Tschechisch]

    Google Scholar 

  • Borůvka, O. [1926b]: Příspevěk k řešení otázky ekonomické stavby. Elektrovodních sítí. Elektrotechnicky Obzor 15 (1926), 153–154 [auf Tschechisch]

    Google Scholar 

  • Cayley, A. [1889]: A theorem on trees. Quarterly Journal on Mathematics 23 (1889), 376–378

    Google Scholar 

  • Chazelle, B. [2000]: A minimum spanning tree algorithm with inverse-Ackermann type complexity. Journal of the ACM 47 (2000), 1028–1047

    Article  MathSciNet  Google Scholar 

  • Cheriton, D., und Tarjan, R.E. [1976]: Finding minimum spanning trees. SIAM Journal on Computing 5 (1976), 724–742

    Article  MathSciNet  Google Scholar 

  • Chu, Y., und Liu, T. [1965]: On the shortest arborescence of a directed graph. Scientia Sinica 4 (1965), 1396–1400; Mathematical Review 33, # 1245

    Google Scholar 

  • Conforti, M., Cornuéjols, G., und Zambelli, G. [2009]: Extended formulations in combinatorial optimization. 4OR 8 (2010), 1–48

    Google Scholar 

  • Diestel, R. [1996]: Graphentheorie. Springer, Berlin 1996

    Book  Google Scholar 

  • Dijkstra, E.W. [1959]: A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959), 269–271

    Article  MathSciNet  Google Scholar 

  • Dixon, B., Rauch, M., und Tarjan, R.E. [1992]: Verification and sensitivity analysis of minimum spanning trees in linear time. SIAM Journal on Computing 21 (1992), 1184–1192

    Article  MathSciNet  Google Scholar 

  • Edmonds, J. [1967]: Optimum branchings. Journal of Research of the National Bureau of Standards B 71 (1967), 233–240

    Article  MathSciNet  Google Scholar 

  • Edmonds, J. [1970]: Submodular functions, matroids and certain polyhedra. In: Combinatorial Structures and Their Applications; Proceedings of the Calgary International Conference on Combinatorial Structures and Their Applications 1969 (R. Guy, H. Hanani, N. Sauer, J. Schönheim, Hrsg.), Gordon and Breach, New York 1970, pp. 69–87

    Google Scholar 

  • Edmonds, J. [1973]: Edge-disjoint branchings. In: Combinatorial Algorithms (R. Rustin, Hrsg.), Algorithmic Press, New York 1973, pp. 91–96

    Google Scholar 

  • Fortune, S. [1987]: A sweepline algorithm for Voronoi diagrams. Algorithmica 2 (1987), 153–174

    Article  MathSciNet  Google Scholar 

  • Frank, A. [1981]: On disjoint trees and arborescences. In: Algebraic Methods in Graph Theory; Colloquia Mathematica Societatis János Bolyai 25 (L. Lovász, V.T. Sós, Hrsg.), North-Holland, Amsterdam 1981, pp. 159–169

    Google Scholar 

  • Frank, A. [1979]: Covering branchings. Acta Scientiarum Mathematicarum (Szeged) 41 (1979), 77–82

    Google Scholar 

  • Fredman, M.L., und Tarjan, R.E. [1987]: Fibonacci heaps and their uses in improved network optimization problems. Journal of the ACM 34 (1987), 596–615

    Article  MathSciNet  Google Scholar 

  • Fredman, M.L., und Willard, D.E. [1994]: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences 48 (1994), 533–551

    Article  MathSciNet  Google Scholar 

  • Fujishige, S. [2010]: A note on disjoint arborescences. Combinatorica 30 (2010), 247–252

    Article  MathSciNet  Google Scholar 

  • Fulkerson, D.R. [1974]: Packing rooted directed cuts in a weighted directed graph. Mathematical Programming 6 (1974), 1–13

    Article  MathSciNet  Google Scholar 

  • Gabow, H.N. [1995]: A matroid approach to finding edge connectivity and packing arborescences. Journal of Computer and System Sciences 50 (1995), 259–273

    Article  MathSciNet  Google Scholar 

  • Gabow, H.N., Galil, Z., und Spencer, T. [1989]: Efficient implementation of graph algorithms using contraction. Journal of the ACM 36 (1989), 540–572

    Article  MathSciNet  Google Scholar 

  • Gabow, H.N., Galil, Z., Spencer, T., und Tarjan, R.E. [1986]: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6 (1986), 109–122

    Article  MathSciNet  Google Scholar 

  • Gabow, H.N., und Manu, K.S. [1998]: Packing algorithms for arborescences (and spanning trees) in capacitated graphs. Mathematical Programming B 82 (1998), 83–109

    Article  MathSciNet  Google Scholar 

  • Jarník, V. [1930]: O jistém problému minimálním. Práca Moravské Přírodovědecké Společnosti 6 (1930), 57–63

    Google Scholar 

  • Karger, D., Klein, P.N., und Tarjan, R.E. [1995]: A randomized linear-time algorithm to find minimum spanning trees. Journal of the ACM 42 (1995), 321–328

    Article  MathSciNet  Google Scholar 

  • Karp, R.M. [1972]: A simple derivation of Edmonds’ algorithm for optimum branchings. Networks 1 (1972), 265–272

    Article  MathSciNet  Google Scholar 

  • King, V. [1997]: A simpler minimum spanning tree verification algorithm. Algorithmica 18 (1997), 263–270

    Article  MathSciNet  Google Scholar 

  • Knuth, D.E. [1992]: Axioms and hulls; LNCS 606. Springer, Berlin 1992

    Google Scholar 

  • Korte, B., und Nešetřil, J. [2001]: Vojtěch Jarník’s work in combinatorial optimization. Discrete Mathematics 235 (2001), 1–17

    Article  MathSciNet  Google Scholar 

  • Kruskal, J.B. [1956]: On the shortest spanning subtree of a graph and the travelling salesman problem. Proceedings of the AMS 7 (1956), 48–50

    Article  MathSciNet  Google Scholar 

  • Lovász, L. [1976]: On two minimax theorems in graph. Journal of Combinatorial Theory B 21 (1976), 96–103

    Article  MathSciNet  Google Scholar 

  • Nash-Williams, C.S.J.A. [1961]: Edge-disjoint spanning trees of finite graphs. Journal of the London Mathematical Society 36 (1961), 445–450

    Article  MathSciNet  Google Scholar 

  • Nash-Williams, C.S.J.A. [1964]: Decompositions of finite graphs into forests. Journal of the London Mathematical Society 39 (1964), 12

    Article  MathSciNet  Google Scholar 

  • Nešetřil, J., Milková, E., und Nešetřilová, H. [2001]: Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history. Discrete Mathematics 233 (2001), 3–36

    Article  MathSciNet  Google Scholar 

  • Pettie, S., und Ramachandran, V. [2002]: An optimal minimum spanning tree algorithm. Journal of the ACM 49 (2002), 16–34

    Article  MathSciNet  Google Scholar 

  • Prim, R.C. [1957]: Shortest connection networks and some generalizations. Bell System Technical Journal 36 (1957), 1389–1401

    Article  Google Scholar 

  • Prüfer, H. [1918]: Neuer Beweis eines Satzes über Permutationen. Arch. Math. Phys. 27 (1918), 742–744

    Google Scholar 

  • Shamos, M.I., und Hoey, D. [1975]: Closest-point problems. Proceedings of the 16th Annual IEEE Symposium on Foundations of Computer Science (1975), 151–162

    Google Scholar 

  • Sylvester, J.J. [1857]: On the change of systems of independent variables. Quarterly Journal of Mathematics 1 (1857), 42–56

    Google Scholar 

  • Tarjan, R.E. [1975]: Efficiency of a good but not linear set union algorithm. Journal of the ACM 22 (1975), 215–225

    Article  MathSciNet  Google Scholar 

  • Tutte, W.T. [1961]: On the problem of decomposing a graph into n connected factor. Journal of the London Mathematical Society 36 (1961), 221–230

    Article  MathSciNet  Google Scholar 

  • Zhou, H., Shenoy, N., und Nicholls, W. [2002]: Efficient minimum spanning tree construction without Delaunay triangulation. Information Processing Letters 81 (2002), 271–276

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Forschungsinstitut für Diskrete Mathematik, Universität Bonn, Bonn, Deutschland

    Bernhard Korte & Jens Vygen

Authors
  1. Bernhard Korte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jens Vygen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bernhard Korte .

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer-Verlag GmbH Deutschland, ein Teil von Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Korte, B., Vygen, J. (2018). Aufspannende Bäume und Arboreszenzen. In: Kombinatorische Optimierung. Masterclass. Springer Spektrum, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-57691-5_6

Download citation

Publish with us

Policies and ethics

Search

Navigation