Pages that link to "Item:Q3613779"
From MaRDI portal
The following pages link to How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover (Q3613779):
Displaying 4 items.
- A metaheuristic approach to the dominating tree problem (Q1677304) (← links)
- On approximation of dominating tree in wireless sensor networks (Q1958639) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- Complexity and Approximation Results for the Connected Vertex Cover Problem (Q3508568) (← links)