Solving maximum weighted matching on large graphs with deep reinforcement learning
From MaRDI portal
Recommendations
- Solving large-scale matching problems efficiently: A new primal matching approach
- Efficient algorithms for maximum weight matchings in general graphs with small edge weights
- scientific article; zbMATH DE number 515943
- A recurrent algorithm to solve the weighted matching problem
- Decomposition algorithms for solving the minimum weight maximal matching problem
Cites work
- A linear-time approximation algorithm for weighted matchings in graphs
- A simple approximation algorithm for the weighted matching problem
- A survey of heuristics for the weighted matching problem
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Collective dynamics of `small-world' networks
- Combinatorial optimization. Networks and matroids
- Emergence of Scaling in Random Networks
- scientific article; zbMATH DE number 432790 (Why is no real title available?)
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 1304326 (Why is no real title available?)
- JGraphT—A Java Library for Graph Data Structures and Algorithms
- Maximum matching and a polyhedron with 0,1-vertices
- On mass transportation
- Paths, Trees, and Flowers
- The Hungarian method for the assignment problem
This page was built for publication: Solving maximum weighted matching on large graphs with deep reinforcement learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6125273)
