Pages that link to "Item:Q1007528"
From MaRDI portal
The following pages link to A simple approximation algorithm for the weighted matching problem (Q1007528):
Displaying 31 items.
- Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint (Q284354) (← links)
- Parallel approximation algorithms for maximum weighted matching in general graphs (Q294847) (← links)
- An enhanced branch-and-bound algorithm for the talent scheduling problem (Q322481) (← links)
- A recurrent algorithm to solve the weighted matching problem (Q341372) (← links)
- Weighted matching as a generic pruning technique applied to optimization constraints (Q490152) (← links)
- Win-win match using a genetic algorithm (Q611494) (← links)
- Approximation algorithms for weighted matching (Q1102118) (← links)
- A \(2/3\)-approximation algorithm for vertex-weighted matching (Q2064284) (← links)
- Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers (Q2149100) (← 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)
- A simple PTAS for weighted matroid matching on strongly base orderable matroids (Q2448875) (← links)
- Local search for constrained graph clustering in biological networks (Q2668745) (← 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)
- A simple PTAS for weighted matroid matching on strongly base orderable matroids (Q2840687) (← links)
- An efficient NC algorithm for approximate maximum weight matching (Q2864855) (← 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)
- A new class of heuristic algorithms for weighted perfect matching (Q3813310) (← 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)
- TRANSPORT IN DYNAMICAL ASTRONOMY AND MULTIBODY PROBLEMS (Q5318365) (← links)
- Dynamic Matching Algorithms in Practice (Q5874529) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900918) (← links)
- Solving maximum weighted matching on large graphs with deep reinforcement learning (Q6125273) (← links)