Pages that link to "Item:Q437058"
From MaRDI portal
The following pages link to Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058):
Displaying 7 items.
- Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (Q331973) (← links)
- Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs (Q2082215) (← links)
- Approximation algorithm for a generalized Roman domination problem in unit ball graphs (Q2292134) (← links)
- (Q3104317) (← links)
- Better algorithms for minimum weight vertex-connectivity problems (Q5048953) (← links)
- A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets (Q5085993) (← links)
- TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET (Q5189988) (← links)