Pages that link to "Item:Q1007528"
From MaRDI portal
The following pages link to A simple approximation algorithm for the weighted matching problem (Q1007528):
Displayed 13 items.
- Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint (Q284354) (← links)
- An enhanced branch-and-bound algorithm for the talent scheduling problem (Q322481) (← links)
- Win-win match using a genetic algorithm (Q611494) (← links)
- A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching (Q2390325) (← links)
- Modularity and greed in double auctions (Q2411517) (← links)
- Efficient Matching for Column Intersection Graphs (Q2828179) (← links)
- Advanced Coarsening Schemes for Graph Partitioning (Q2828188) (← 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-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- ASSIGNMENT QUERY AND ITS IMPLEMENTATION IN MOVING OBJECT DATABASES (Q3565423) (← links)
- TRANSPORT IN DYNAMICAL ASTRONOMY AND MULTIBODY PROBLEMS (Q5318365) (← links)