Journal of the ACM (JACM)
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Maximum Matchings via Gaussian Elimination
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms
INFORMS Journal on Computing
On packing shortest cycles in graphs
Information Processing Letters
Exponential-time approximation of weighted set cover
Information Processing Letters
A polynomial case of the parsimony haplotyping problem
Operations Research Letters
| Hi-index | 0.89 |
In this paper we consider the Minimum Rainbow Subgraph problem (MRS): Given a graph G with n vertices whose edges are coloured with p colours, find a subgraph F@?G of minimum order and with p edges such that F contains each colour exactly once. We present a polynomial time (12+(12+@e)@D)-approximation algorithm for the MRS problem for an arbitrary small positive @e. This improves the previously best known approximation ratio of 56@D. We also prove the MRS problem to be NP-hard and APX-hard for graphs with maximum degree 2. Finally we present an algorithm to find an optimal solution in running time O(2^(^p^+^2^p^l^o^g^"^2^@D^)n^O^(^1^)).