Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Stephan Matos Camacho, Ingo Schiermeyer, Zsolt Tuza. Approximation algorithms for the minimum rainbow subgraph problem. Discrete Mathematics, 310(20):2666-2670, 2010. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Improved approximation bounds for the minimum rainbow subgraph problemJán Katrenic, Ingo Schiermeyer. ipl, 111(3):110-114, 2011. [doi] Algorithmic approaches for the minimum rainbow subgraph problemMaria Koch, Stephan Matos Camacho, Ingo Schiermeyer. endm, 38:765-770, 2011. [doi]
The following publications are possibly variants of this publication: