The following pages link to (Q4250185):
Displaying 13 items.
- A two-stage hardware scheduler combining greedy and optimal scheduling (Q436901) (← links)
- A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks (Q555319) (← links)
- Local approximability of max-min and min-max linear programs (Q693753) (← links)
- On the distributed complexity of the semi-matching problem (Q736606) (← links)
- A simple local 3-approximation algorithm for vertex cover (Q987844) (← links)
- Linear-in-\(\varDelta \) lower bounds in the LOCAL model (Q1689747) (← links)
- Almost stable matchings by truncating the Gale-Shapley algorithm (Q1959728) (← links)
- Improved deterministic distributed matching via rounding (Q2189173) (← links)
- Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
- Brief Announcement: Distributed Approximations for the Semi-matching Problem (Q3095327) (← links)
- NC Algorithms for Weighted Planar Perfect Matching and Related Problems (Q5002779) (← links)
- Distributed Approximate Maximum Matching in the CONGEST Model. (Q5090895) (← links)
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
