The following pages link to (Q4828945):
Displaying 12 items.
- Approximation algorithms for partially covering with edges (Q930925) (← links)
- Path hitting in acyclic graphs (Q1018049) (← links)
- Minimum-cost \(b\)-edge dominating sets on trees (Q1755793) (← links)
- Tight inapproximability of minimum maximal matching on bipartite graphs and related problems (Q2085735) (← links)
- On \(b\)-matchings and \(b\)-edge dominating sets: a 2-approximation algorithm for the 4-edge dominating set problem (Q2085737) (← links)
- Approximation hardness of edge dominating set problems (Q2369972) (← links)
- Approximability of the capacitated \(b\)-edge dominating set problem (Q2456372) (← links)
- Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
- Linear time algorithms for generalized edge dominating set problems (Q2480902) (← links)
- Minimum-Cost $$b$$-Edge Dominating Sets on Trees (Q2942628) (← links)
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← links)
- An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set (Q5321717) (← links)
