The following pages link to (Q4251057):
Displaying 26 items.
- Parallel approximation algorithms for maximum weighted matching in general graphs (Q294847) (← links)
- A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2 (Q719295) (← links)
- A simple approximation algorithm for the weighted matching problem (Q1007528) (← links)
- Adaptive AMG with coarsening based on compatible weighted matching (Q1684418) (← links)
- Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists (Q1736596) (← links)
- A \(2/3\)-approximation algorithm for vertex-weighted matching (Q2064284) (← links)
- A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching (Q2390325) (← links)
- Modularity and greed in double auctions (Q2411517) (← links)
- The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs (Q2420642) (← links)
- Weighted matching in the semi-streaming model (Q2428674) (← links)
- Linear time algorithms for generalized edge dominating set problems (Q2480902) (← links)
- Multi-agent reinforcement learning for decentralized stable matching (Q2695458) (← links)
- Efficient Matching for Column Intersection Graphs (Q2828179) (← links)
- Efficient Approximation Algorithms for Weighted $b$-Matching (Q2830632) (← links)
- Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems (Q2971609) (← links)
- Near Approximation of Maximum Weight Matching through Efficient Weight Reduction (Q3010385) (← links)
- Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem (Q3012945) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- Parallel Aggregation Based on Compatible Weighted Matching for AMG (Q3297463) (← links)
- (Q4536416) (← links)
- Deep Haar scattering networks (Q4603720) (← links)
- A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs (Q4623143) (← links)
- (Q4731220) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
- Solving maximum weighted matching on large graphs with deep reinforcement learning (Q6125273) (← links)
- Automatic coarsening in algebraic multigrid utilizing quality measures for matching-based aggregations (Q6176673) (← links)
