Improved approximation bounds for the minimum rainbow subgraph problem

► Polynomial time approximation to the Minimum rainbow subgraph and Minimum primer set in terms of maximum degree of a graph. ► Minimum rainbow subgraph problem is NP-hard and APX-hard even for graphs with maximum degree 2. ► Exact algorithm to the Minimum rainbow subgraph problem. ► Fixed-parameter tractability for the Minimum rainbow subgraph problem.