Revisiting a randomized algorithm for the minimum rainbow subgraph problem

DOI10.1016/J.TCS.2015.05.042zbMATH Open1330.68345OpenAlexW609036798MaRDI QIDQ501008FDOQ501008

Authors: Chen Yuan, Haibin Kan 

Publication date: 8 October 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.042

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

zbMATH Keywords

randomized algorithmminimum rainbow subgraph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Analysis of algorithms (68W40) Approximation algorithms (68W25) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Improved approximation bounds for the minimum rainbow subgraph problem
• Better lower and upper bounds for the minimum rainbow subgraph problem
• Algorithmic approaches for the minimum rainbow subgraph problem
• Approximation algorithms for the minimum rainbow subgraph problem

Cited In (1)

• Better lower and upper 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)