The following pages link to (Q2753930):
Displaying 4 items.
- A 2-approximation algorithm for the minimum weight edge dominating set problem (Q1602689) (← links)
- On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- Tight inapproximability of minimum maximal matching on bipartite graphs and related problems (Q2085735) (← links)
