Pages that link to "Item:Q4899238"
From MaRDI portal
The following pages link to New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set (Q4899238):
Displaying 4 items.
- Parameterized edge dominating set in graphs with degree bounded by 3 (Q388085) (← links)
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- On the max min vertex cover problem (Q499339) (← links)
- Tight inapproximability of minimum maximal matching on bipartite graphs and related problems (Q2085735) (← links)