Pages that link to "Item:Q2234806"
From MaRDI portal
The following pages link to A polylogarithmic approximation algorithm for 2-edge-connected dominating set (Q2234806):
Displaying 8 items.
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- 2-node-connectivity network design (Q2117701) (← links)
- Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
- Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012) (← links)
- A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2 (Q3177821) (← links)
- 2-node-connectivity network design (Q6122594) (← links)
- A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem (Q6645156) (← links)
