New algorithms for maximum weight matching and a decomposition theorem
From MaRDI portal
Recommendations
- A decomposition theorem for maximum weight bipartite matchings
- Efficient algorithms for maximum weight matchings in general graphs with small edge weights
- Decomposition algorithms for solving the minimum weight maximal matching problem
- A modified decomposition algorithm for maximum weight bipartite matching and its experimental evaluation
- Fine-tuning decomposition theorem for maximum weight bipartite matching
Cited in
(15)- Exact and approximation algorithms for weighted matroid intersection
- An algorithmic approach to dual integrality of matching and extensions
- A decomposition theorem for maximum weight bipartite matchings
- Decomposition algorithms for solving the minimum weight maximal matching problem
- An efficient NC algorithm for approximate maximum weight matching
- Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
- Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes
- A simple reduction from maximum weight matching to maximum cardinality matching
- A modified decomposition algorithm for maximum weight bipartite matching and its experimental evaluation
- Fine-tuning decomposition theorem for maximum weight bipartite matching
- Efficient algorithms for maximum weight matchings in general graphs with small edge weights
- Novel algorithms for maximum DS decomposition
- Novel algorithms for maximum DS decomposition
- A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2
- Efficient algorithms for variants of weighted matching and assignment problems
This page was built for publication: New algorithms for maximum weight matching and a decomposition theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739147)
