The following pages link to Computing and Combinatorics (Q5716997):
Displaying 6 items.
- Minimum edge blocker dominating set problem (Q319914) (← links)
- Approximation algorithms for partially covering with edges (Q930925) (← links)
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
- Approximability of the capacitated \(b\)-edge dominating set problem (Q2456372) (← links)
- (Q4472438) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)