Revisiting a randomized algorithm for the minimum rainbow subgraph problem

DOI10.1016/j.tcs.2015.05.042zbMath1330.68345OpenAlexW609036798MaRDI QIDQ501008

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

zbMATH Keywords

randomized algorithmminimum rainbow subgraph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for the minimum rainbow subgraph problem
• Improved approximation bounds for the minimum rainbow subgraph problem
• 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