Pages that link to "Item:Q2456372"
From MaRDI portal
The following pages link to Approximability of the capacitated \(b\)-edge dominating set problem (Q2456372):
Displaying 16 items.
- Approximation algorithms for partially covering with edges (Q930925) (← links)
- Improved approximation bounds for edge dominating set in dense graphs (Q1006077) (← links)
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- Covering problems in edge- and node-weighted graphs (Q1751155) (← links)
- Minimum-cost \(b\)-edge dominating sets on trees (Q1755793) (← links)
- Integer programming formulations for the minimum weighted maximal matching problem (Q1758060) (← links)
- On \(b\)-matchings and \(b\)-edge dominating sets: a 2-approximation algorithm for the 4-edge dominating set problem (Q2085737) (← links)
- Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
- Linear time algorithms for generalized edge dominating set problems (Q2480902) (← links)
- Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
- Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← links)
- Minimum-Cost $$b$$-Edge Dominating Sets on Trees (Q2942628) (← links)
- Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b–Matching Problems in Nonbipartite Graphs (Q5383977) (← links)
- Computing and Combinatorics (Q5716997) (← links)
- On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)