Pages that link to "Item:Q513303"
From MaRDI portal
The following pages link to Greedy matching: guarantees and limitations (Q513303):
Displaying 13 items.
- Performance analysis of greedy algorithms for Max-IS and Min-Maxl-Match (Q1002430) (← links)
- An exact performance bound for an \(O(m+n)\) time greedy matching procedure (Q1378525) (← links)
- Erratum to: ``Greedy matching: guarantees and limitations'' (Q1702135) (← links)
- On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)
- Greedy Matching on the Line (Q3474883) (← links)
- Greedy Bipartite Matching in Random Type Poisson Arrival Model (Q5009497) (← links)
- Greedy Matching in Bipartite Random Graphs (Q5084502) (← links)
- (Q5874548) (← links)
- (Q5875458) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
- Advice complexity of priority algorithms (Q5916086) (← links)
- Advice complexity of adaptive priority algorithms (Q6180750) (← links)
- The average size of maximal matchings in graphs (Q6497032) (← links)