The following pages link to (Q2753739):
Displaying 6 items.
- Approximating the tree and tour covers of a graph (Q688437) (← links)
- On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
- Better \(s-t\)-tours by Gao trees (Q1800996) (← links)
- A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219) (← links)
- A Primal-Dual Method for Approximating Tree Cover with Two Weights (Q3439142) (← links)
- Approaches to the Steiner Problem in Networks (Q3637313) (← links)