Pages that link to "Item:Q1006053"
From MaRDI portal
The following pages link to Algorithms for connected set cover problem and fault-tolerant connected set cover problem (Q1006053):
Displaying 8 items.
- An approximation algorithm for maximum weight budgeted connected set cover (Q281790) (← links)
- The relation of connected set cover and group Steiner tree (Q441864) (← links)
- A note on `Algorithms for connected set cover problem and fault-tolerant connected set cover problem' (Q653341) (← links)
- A simple approximation algorithm for minimum weight partial connected set cover (Q1680500) (← links)
- Wireless networking, dominating and packing (Q1958633) (← links)
- A heuristic approach for dividing graphs into bi-connected components with a size constraint (Q2403269) (← links)
- Clustering with Internal Connectedness (Q3078394) (← links)
- Approximation algorithms for minimum weight partial connected set cover problem (Q5963645) (← links)