Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem (Q3183476): 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.1007/978-3-642-03367-4_40
+Normal rank
@@ Property / OpenAlex ID @@
+W1513252978
@@ Property / OpenAlex ID: W1513252978 / rank @@
+Normal rank
@@ Property / cites work @@
+On finding spanning trees with few leaves
@@ Property / cites work: On finding spanning trees with few leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Neighborhood unions and extremal spanning trees
@@ Property / cites work: Neighborhood unions and extremal spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q3369936
@@ Property / cites work: Q3369936 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact and Parameterized Algorithms for Max Internal Spanning Tree
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Maximum Internal Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Approximate Local Search in Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+Approximating the maximum internal spanning tree problem
+Normal rank