Pages that link to "Item:Q2830632"
From MaRDI portal
The following pages link to Efficient approximation algorithms for weighted \(b\)-matching (Q2830632):
Displaying 9 items.
- Efficient algorithms for variants of weighted matching and assignment problems (Q942999) (← links)
- A \(2/3\)-approximation algorithm for vertex-weighted matching (Q2064284) (← links)
- Multi-agent reinforcement learning for decentralized stable matching (Q2695458) (← links)
- An efficient NC algorithm for approximate maximum weight matching (Q2864855) (← links)
- A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs (Q4623143) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
- Approximate Matching in Weighted Sequences (Q5307520) (← links)
- A memetic algorithm to schedule planned maintenance for the national grid (Q5463392) (← links)
- Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple (Q6116659) (← links)