Pages that link to "Item:Q453623"

The following pages link to Complexity and approximation of the connected set-cover problem (Q453623):

Displaying 13 items.

• Multi-start iterated tabu search for the minimum weight vertex cover problem (Q306082) (← links)
• A note on `Algorithms for connected set cover problem and fault-tolerant connected set cover problem' (Q653341) (← links)
• A \(\Theta (\log n)\)-approximation for the set cover problem with set ownership (Q976067) (← links)
• Algorithms for connected set cover problem and fault-tolerant connected set cover problem (Q1006053) (← links)
• A simple approximation algorithm for minimum weight partial connected set cover (Q1680500) (← links)
• Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
• Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
• (Q2941638) (← links)
• Approximability results for the converse connected<i>p</i>-centre problem^† (Q2958261) (← links)
• Universal approximations for TSP, Steiner tree, and set cover (Q3581400) (← links)
• (Q4595724) (← links)
• Connected Set Cover Problem and Its Applications (Q5434403) (← links)
• Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)