Pages that link to "Item:Q2390325"

The following pages link to A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching (Q2390325):

Displaying 16 items.

• Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint (Q284354) (← links)
• Distributed approximation for maximum weight matching on bounded degree bounded integer weight graphs (Q989486) (← links)
• Costly circuits, submodular schedules and approximate Carathéodory theorems (Q1649974) (← links)
• Best of two local models: centralized local and distributed local algorithms (Q1784947) (← links)
• A \(2/3\)-approximation algorithm for vertex-weighted matching (Q2064284) (← links)
• Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers (Q2149100) (← links)
• Weighted matching in the semi-streaming model (Q2428674) (← links)
• Efficient Matching for Column Intersection Graphs (Q2828179) (← 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)
• A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs (Q4623143) (← links)
• Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs (Q5115699) (← links)
• A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs (Q5132024) (← links)
• Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)