Approximation algorithms and hardness results for the clique packing problem (Q5902134): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2008.10.017
+Normal rank
@@ Property / OpenAlex ID @@
+W2049206926
@@ Property / OpenAlex ID: W2049206926 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing triangles in bounded degree graphs.
@@ Property / cites work: Packing triangles in bounded degree graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms and hardness results for the clique packing problem
+Normal rank
@@ Property / cites work @@
+Approximating k-set cover and complementary graph coloring
+Normal rank
@@ Property / cites work @@
+On the Complexity of General Graph Factor Problems
+Normal rank
@@ Property / cites work @@
+Packings by cliques and by finite families of graphs
+Normal rank
@@ Property / cites work @@
+On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
+Normal rank
@@ Property / cites work @@
+Packing triangles in low degree graphs and indifference graphs
+Normal rank