Pages that link to "Item:Q1879245"

The following pages link to Improved approximations for tour and tree covers (Q1879245):

Displaying 8 items.

• Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← links)
• Approximating the minimum tour cover of a digraph (Q1736480) (← links)
• Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
• Approximability of the capacitated \(b\)-edge dominating set problem (Q2456372) (← links)
• A primal-dual method for approximating tree cover with two weights (Q2465937) (← links)
• Approximation algorithms for metric tree cover and generalized tour and tree covers (Q3004205) (← links)
• Approximating the Minimum Tour Cover with a Compact Linear Program (Q3192959) (← links)
• Complexity and Approximation Results for the Connected Vertex Cover Problem (Q3508568) (← links)