Pages that link to "Item:Q5952320"
From MaRDI portal
The following pages link to A \(2\frac{1}{10}\)-approximation algorithm for a generalization of the weighted edge-dominating set problem (Q5952320):
Displaying 17 items.
- Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
- Approximating edge dominating set in dense graphs (Q764308) (← links)
- Improved approximation bounds for edge dominating set in dense graphs (Q1006077) (← links)
- Path hitting in acyclic graphs (Q1018049) (← links)
- Covering problems in edge- and node-weighted graphs (Q1751155) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- On \(b\)-matchings and \(b\)-edge dominating sets: a 2-approximation algorithm for the 4-edge dominating set problem (Q2085737) (← links)
- Domination versus edge domination (Q2197443) (← links)
- Bounding and approximating minimum maximal matchings in regular graphs (Q2222947) (← links)
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← 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)
- Approximating the Minimum Tour Cover with a Compact Linear Program (Q3192959) (← links)
- Exact Algorithms for Edge Domination (Q3503591) (← links)
- A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem (Q3602847) (← links)
