Pages that link to "Item:Q5368958"
From MaRDI portal
The following pages link to Distributed Approximation of Maximum Independent Set and Maximum Matching (Q5368958):
Displayed 9 items.
- Optimal distributed covering algorithms (Q2689837) (← links)
- Distributed Approximate Maximum Matching in the CONGEST Model. (Q5090895) (← links)
- Distributed set cover approximation: Primal-dual with optimal locality (Q5090914) (← links)
- (Q5090928) (← links)
- Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs (Q5115699) (← links)
- Simple and local independent set approximation (Q5919021) (← links)
- Node and edge averaged complexities of local graph problems (Q6071120) (← links)
- The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs (Q6202219) (← links)
- (1- <i>ϵ</i> )-Approximate Maximum Weighted Matching in poly(1/ <i>ϵ</i> , log <i>n</i> ) Time in the Distributed and Parallel Settings (Q6202220) (← links)