Revisiting a randomized algorithm for the minimum rainbow subgraph problem
From MaRDI portal
Publication:501008
Recommendations
- Approximation algorithms for the minimum rainbow subgraph problem
- Algorithmic approaches for the minimum rainbow subgraph problem
- On the approximability of the minimum rainbow subgraph problem and other related problems
- On the approximability of the minimum rainbow subgraph problem and other related problems
- Improved approximation bounds for the minimum rainbow subgraph problem
- Better lower and upper bounds for the minimum rainbow subgraph problem
- The parameterized complexity of the rainbow subgraph problem
- The parameterized complexity of the rainbow subgraph problem
- On the minimum rainbow subgraph number of a graph
- Algorithms for the rainbow vertex coloring problem on graph classes
Cites work
- scientific article; zbMATH DE number 434896 (Why is no real title available?)
- Algorithmic approaches for the minimum rainbow subgraph problem
- Approximation algorithms for the minimum rainbow subgraph problem
- Better lower and upper bounds for the minimum rainbow subgraph problem
- Improved approximation bounds for the minimum rainbow subgraph problem
This page was built for publication: Revisiting a randomized algorithm for the minimum rainbow subgraph problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501008)