Skip to main content
Book Chapter

Weighted Matching

  • Korte B
  • Vygen J
DOI: 10.1007/978-3-662-21711-5_11
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Nonbipartite weighted matching appears to be one of the ``hardest'' combinatorial optimization problems that can be solved in polynomial time. We shall extend Edmonds' Cardinality Matching Algorithm to the weighted case and shall again obtain an O(n3)-implementation. This algorithm has many applications, some of which are mentioned in the exercises and in Section 12.2.

Cite

CITATION STYLE

APA

Korte, B., & Vygen, J. (2002). Weighted Matching (pp. 235–260). https://doi.org/10.1007/978-3-662-21711-5_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free