Approximation algorithms for the minimum rainbow subgraph problem
type: Item
instance of: scholarly article
title: Approximation algorithms for the minimum rainbow subgraph problem
zbMATH Open document ID: 1215.05181
author: Stephan Matos Camacho
author: Ingo Schiermeyer
author: Zsolt Tuza
published in: Discrete Mathematics
publication date: 2010-10-18T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5801209
zbMATH Keywords: edge colouring
zbMATH Keywords: minimum rainbow subgraph
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: j.disc.2010.03.032
OpenAlex ID: W2077912839
cites work: Complexity of finding dense subgraphs
cites work: Q5422499
cites work: Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping
cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
cites work: From the theory of regular graphs of third and fourth degree
cites work: Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms
cites work: A polynomial case of the parsimony haplotyping problem
DOI: 10.1016/J.DISC.2010.03.032
description: scientific article; zbMATH DE number 5801209