Skip to main content
SpringerLink
Log in

Gewichtete Matchings

  • Chapter
  • First Online:
Kombinatorische Optimierung

Part of the book series: Springer-Lehrbuch Masterclass ((MASTERCLASS))

  • 7123 Accesses

Zusammenfassung

Das nicht-bipartite gewichtete Matching-Problem scheint eines der „schwersten“ in polynomieller Zeit lösbaren kombinatorischen Optimierungsprobleme zu sein. Wir werden EDMONDS’ KARDINALITÄTS-MATCHING-ALGORITHMUS für den gewichteten Fall erweitern und eine O (n3)-Implementierung angeben. Dieser Algorithmus hat diverse Anwendungen, von denen einige in den Aufgaben und in Abschnitt 12.2 vorgestellt werden.

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

Access this chapter

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 39.95
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Balinski, M.L.: Establishing the matching polytope. Journal of Combinatorial Theory 13, 1–13 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ball, M.O., Derigs, U.: An analysis of alternative strategies for implementing matching algorithms. Networks 13, 517–549 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  3. Birkhoff, G.: Tres observaciones sobre el algebra lineal. Revista Universidad Nacional de Tucumán, Series A 5, 147–151 (1946)

    MathSciNet  MATH  Google Scholar 

  4. Burkard, R., Dell'Amico, M., Martello, S.: Assignment Problems. SIAM, Philadelphia (2009)

    Book  MATH  Google Scholar 

  5. Cook, W.J., Rohe, A.: Computing minimum-weight perfect matchings. INFORMS Journal of Computing 11, 138–148 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cunningham, W.H., Marsh, A.B.: A primal algorithm for optimum matching. Mathematical Programming Study 8, 50–72 (1978)

    Article  MathSciNet  Google Scholar 

  7. Edmonds, J.: Maximum matching and a polyhedron with (0,1) vertices. Journal of Research of the National Bureau of Standards B 69, 125–130 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  8. Egerváry, E.: Matrixok kombinatorikus tulajdonságairol. Matematikai és Fizikai Lapok 38, 16–28 (1931) [auf Ungarisch]

    MATH  Google Scholar 

  9. Gabow, H.N.: Implementation of algorithms for maximum matching on non-bipartite graphs. Ph.D. Thesis. Stanford University, Dept. of Computer Science (1973)

    Google Scholar 

  10. Gabow, H.N.: An efficient implementation of Edmonds' algorithm for maximum matching on graphs. Journal of the ACM 23, 221–234 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  11. Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, S. 434–443 (1990)

    Google Scholar 

  12. Grötschel, M., Pulleyblank, W.R.: Weakly bipartite graphs and the max-cut problem. Operations Research Letters 1, 23–27 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kolmogorov, V.: Blossom V: a new implementation of a minimum cost perfect matching algorithm. Mathematical Programming Computation 1, 43–67 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2, 83–97 (1955)

    Article  MathSciNet  Google Scholar 

  15. Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal on Applied Mathematics 36, 177–189 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  16. Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM Journal on Computing 9, 615–627 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  17. Lovász, L.: Graph theory and integer programming. In: Hammer, P.L., Johnson, E.L., Korte, B.H. (Hrsg.) Discrete Optimization I. Annals of Discrete Mathematics, Bd. 4, S. 141–158. North-Holland, Amsterdam (1979)

    Google Scholar 

  18. Mehlhorn, K., Schäfer, G.: Implementation of \(O(nm\log n)\) weighted matchings in general graphs: the power of data structures. In: Näher, S., Wagner, D. (Hrsg.) Algorithm Engineering; WAE-2000. LNCS, Bd. 1982. S. 23–38; also electronically in The ACM Journal of Experimental Algorithmics 7 (2002)

    Google Scholar 

  19. Monge, G.: Mémoire sur la théorie des déblais et des remblais. Histoire de l'Académie Royale des Sciences 2, 666–704 (1784)

    Google Scholar 

  20. Munkres, J.: Algorithms for the assignment und transportation problems. Journal of the Society for Industrial and Applied Mathematics 5, 32–38 (1957)

    Article  MathSciNet  MATH  Google Scholar 

  21. Naddef, D., Pulleyblank, W.R.: Matchings in regular graphs. Discrete Mathematics 34, 283–291 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  22. von Neumann, J.: A certain zero-sum two-person game equivalent to the optimal assignment problem. In: Kuhn, H.W. (Hrsg.) Contributions to the Theory of Games II. Ann. of Math. Stud., Bd. 28, S. 5–12. Princeton University Press, Princeton (1953)

    Google Scholar 

  23. Schrijver, A.: Short proofs on the matching polyhedron. Journal of Combinatorial Theory B 34, 104–108 (1983a)

    Article  MathSciNet  MATH  Google Scholar 

  24. Schrijver, A.: Min-max results in combinatorial optimization. In: Bachem, A., Grötschel, M., Korte, B. (Hrsg.) Mathematical Programming; The State of the Art – Bonn 1982, S. 439–500. Springer, Berlin (1983b)

    Chapter  Google Scholar 

  25. Varadarajan, K.R.: A divide-and-conquer algorithm for min-cost perfect matching in the plane. Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, S. 320–329 (1998)

    Google Scholar 

  26. Weber, G.M.: Sensitivity analysis of optimal matchings. Networks 11, 41–56 (1981)

    Article  MathSciNet  MATH  Google Scholar 

Weiterführende Literatur

  1. Gerards, A.M.H.: Matching. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (Hrsg.) Handbooks in Operations Research and Management Science, Vol. 7: Network Models, S. 135–224. Elsevier, Amsterdam (1995)

    Chapter  Google Scholar 

  2. Lawler, E.L.: Combinatorial Optimization; Networks and Matroids, Kap. 5, 6. Holt, Rinehart and Winston, New York (1976)

    MATH  Google Scholar 

  3. Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization; Algorithms and Complexity, Kap. 11. Prentice-Hall, Englewood Cliffs (1982)

    MATH  Google Scholar 

  4. Pulleyblank, W.R.: Matchings and extensions. In: Graham, R.L., Grötschel, M., Lovász, L. (Hrsg.) Handbook of Combinatorics, Vol. 1. Elsevier, Amsterdam (1995)

    Google Scholar 

Download references

Author information

Author notes

  1. Bernhard Korte & Jens Vygen

    Present address: Forschungsinstitut für Diskrete Mathematik, Universität Bonn, Lennestr. 2, 53113, Bonn, Deutschland

Authors and Affiliations

    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 authors

    Correspondence to Bernhard Korte or Jens Vygen .

    Rights and permissions

    Reprints and permissions

    Copyright information

    © 2012 Springer-Verlag Berlin Heidelberg

    About this chapter

    Cite this chapter

    Korte, B., Vygen, J. (2012). Gewichtete Matchings. In: Kombinatorische Optimierung. Springer-Lehrbuch Masterclass. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25401-7_11

    Download citation

    Publish with us

    Policies and ethics

    Search

    Navigation