Pages that link to "Item:Q3188895"
From MaRDI portal
The following pages link to On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem (Q3188895):
Displaying 7 items.
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- Minimum-cost \(b\)-edge dominating sets on trees (Q1755793) (← links)
- On \(b\)-matchings and \(b\)-edge dominating sets: a 2-approximation algorithm for the 4-edge dominating set problem (Q2085737) (← links)
- Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
- Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs (Q3066473) (← links)
- Computing and Combinatorics (Q5716997) (← links)
- On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)