The following pages link to (Q4472438):
Displaying 11 items.
- On the max min vertex cover problem (Q499339) (← links)
- Approximating the minimum independent dominating set in perturbed graphs (Q744108) (← links)
- On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
- Improved budgeted connected domination and budgeted edge-vertex domination (Q2222087) (← links)
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← 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)
- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination (Q5041206) (← links)
- Computing and Combinatorics (Q5716997) (← links)