An approximation algorithm for maximum triangle packing (Q2492197): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2005.11.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2129303870
@@ Property / OpenAlex ID: W2129303870 / rank @@
+Normal rank
@@ Property / cites work @@
+On Local Search for Weighted <i>k</i>-Set Packing
@@ Property / cites work: On Local Search for Weighted <i>k</i>-Set Packing / rank @@
+Normal rank
@@ Property / cites work @@
+Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)
+Normal rank
@@ Property / cites work @@
+Q2708231
@@ Property / cites work: Q2708231 / rank @@
+Normal rank
@@ Property / cites work @@
+Greedy Local Improvement and Weighted Set Packing Approximation
+Normal rank
@@ Property / cites work @@
+Q4437505
@@ Property / cites work: Q4437505 / rank @@
+Normal rank
@@ Property / cites work @@
+`` Strong '' NP-Completeness Results
@@ Property / cites work: `` Strong '' NP-Completeness Results / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886045
@@ Property / cites work: Q4886045 / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for maximum packing of 3-edge paths
+Normal rank
@@ Property / cites work @@
+Better approximations for max TSP
@@ Property / cites work: Better approximations for max TSP / rank @@
+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 @@
+Maximum bounded 3-dimensional matching is MAX SNP-complete
+Normal rank
@@ Property / cites work @@
+A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph
+Normal rank