Pages that link to "Item:Q613113"
From MaRDI portal
The following pages link to Distributed approximation of capacitated dominating sets (Q613113):
Displaying 9 items.
- Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- Deterministic distributed construction of \(T\)-dominating sets in time \(T\) (Q1786883) (← links)
- Fast primal-dual distributed algorithms for scheduling and matching problems (Q2377143) (← links)
- Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
- Distributed Dominating Set Approximations beyond Planar Graphs (Q4972685) (← links)
- Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
- Fast Distributed Approximation for Max-Cut (Q5056049) (← links)
- (Q5743464) (← links)