A short note on the approximability of the maximum leaves spanning tree problem (Q1336751): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(94)90139-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2035040468
@@ Property / OpenAlex ID: W2035040468 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230322
@@ Property / cites work: Q4230322 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230321
@@ Property / cites work: Q4230321 / rank @@
+Normal rank
@@ Property / cites work @@
+Completeness in approximation classes
@@ Property / cites work: Completeness in approximation classes / rank @@
+Normal rank
@@ Property / cites work @@
+Self-stabilizing systems in spite of distributed control
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Q3928248
@@ Property / cites work: Q3928248 / rank @@
+Normal rank