Engineering Algorithms for Approximate Weighted Matching
From MaRDI portal
Recommendations
- A linear-time approximation algorithm for weighted matchings in graphs
- A simple approximation algorithm for the weighted matching problem
- Improved linear time approximation algorithms for weighted matchings
- A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching
- Fast and Simple Algorithms for Weighted Perfect Matching
Cited in
(17)- Integer programming formulations for the minimum weighted maximal matching problem
- A \(2/3\)-approximation algorithm for vertex-weighted matching
- Local search for constrained graph clustering in biological networks
- Efficient matching for column intersection graphs
- Advanced coarsening schemes for graph partitioning
- Efficient approximation algorithms for weighted b-matching
- A linear-time approximation algorithm for weighted matchings in graphs
- scientific article; zbMATH DE number 1501972 (Why is no real title available?)
- A 2/3-approximation algorithm for vertex weighted matching in bipartite graphs
- scientific article; zbMATH DE number 4116586 (Why is no real title available?)
- Parallel Weighted Random Sampling
- Approximation algorithms in combinatorial scientific computing
- Tree-based coarsening and partitioning of complex networks
- Greedy in Approximation Algorithms
- Dynamic Matching Algorithms in Practice
- Semi-streaming algorithms for weighted k-disjoint matchings
- Semi-streaming algorithms for hypergraph matching
This page was built for publication: Engineering Algorithms for Approximate Weighted Matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5432319)
