Improved approximation bounds for the minimum rainbow subgraph problem (Q1944047): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2010.11.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2045197802
@@ Property / OpenAlex ID: W2045197802 / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619846
@@ Property / cites work: Q3619846 / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential-time approximation of weighted set cover
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+From the theory of regular graphs of third and fourth degree
+Normal rank
@@ Property / cites work @@
+Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms
+Normal rank
@@ Property / cites work @@
+A polynomial case of the parsimony haplotyping problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the minimum rainbow subgraph problem
+Normal rank
@@ Property / cites work @@
+On packing shortest cycles in graphs
@@ Property / cites work: On packing shortest cycles in graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1944047