Pages that link to "Item:Q661048"
From MaRDI portal
The following pages link to Distributed algorithms for covering, packing and maximum weighted matching (Q661048):
Displaying 9 items.
- Distributed backup placement in networks (Q1741963) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- Improved deterministic distributed matching via rounding (Q2189173) (← links)
- Parallel approximation for partial set cover (Q2243336) (← links)
- Set cover problems with small neighborhood covers (Q2322696) (← links)
- Optimal distributed covering algorithms (Q2689837) (← links)
- Efficient Approximation Algorithms for Weighted $b$-Matching (Q2830632) (← links)
- Distributed set cover approximation: Primal-dual with optimal locality (Q5090914) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
