The following pages link to Randomized greedy matching. II (Q4322476):
Displaying 13 items.
- Greedy matching: guarantees and limitations (Q513303) (← links)
- Some recent results in the analysis of greedy algorithms for assignment problems (Q1317524) (← links)
- On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)
- Excuse me! or the courteous theatregoers' problem (Q2347004) (← links)
- Inapproximability of b-Matching in k-Uniform Hypergraphs (Q3078381) (← links)
- Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming (Q4581907) (← links)
- Online Vertex-Weighted Bipartite Matching (Q4972684) (← links)
- (Q5002758) (← links)
- Greedy Matching in Bipartite Random Graphs (Q5084502) (← links)
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
- Computing maximum matchings in temporal graphs (Q6168321) (← links)
- The average size of maximal matchings in graphs (Q6497032) (← links)