Search

Showing total 1 results

Refine your results

1 results

1. Approximation algorithms for the minimum rainbow subgraph problem

Author

Matos Camacho, Stephan, Schiermeyer, Ingo, and Tuza, Zsolt

Subjects
*APPROXIMATION theory, *ALGORITHMS, *GRAPH theory, *GRAPH coloring, *POLYNOMIALS, *TOPOLOGICAL degree
Abstract

Abstract: We consider the minimum rainbow subgraph problem (MRS): given a graph , whose edges are coloured with colours. Find a subgraph of of minimum order and with edges such that each colour occurs exactly once. For graphs with maximum degree there is a greedy polynomial-time approximation algorithm for the MRS problem with an approximation ratio of . In this paper we present a polynomial-time approximation algorithm with an approximation ratio of for . [ABSTRACT FROM AUTHOR]

Published
2010
Full Text
View/download PDF