Quartz 4

Home

❯

Minimum cost bipartite matching

Minimum-cost bipartite matching

Feb 01, 20261 min read

  • uni/AA

is basically the Maximum-weight bipartite matching with inverted weights.

Proof: Advanced Algorithms UE 1.3


Graph View

Backlinks

  • AA Flashcards Scheduling Problems
  • Unrelated Maschines
  • Weighted Bipartite Matchings

Created with Quartz v4.5.1 © 2026

  • GitHub
  • Discord Community