Approximation algorithms for the maximum weight internal spanning tree problem (Q5919671): Difference between revisions

← Older edit

@@ description / en / description / en @@
-scientific article; zbMATH DE number 7118907
+scientific article; zbMATH DE number 6796719
@@ Property / zbMATH Open document ID @@
+.68150
@@ Property / zbMATH Open document ID: 1431.68150 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-62389-4_11
@@ Property / DOI: 10.1007/978-3-319-62389-4_11 / rank @@
+Normal rank
@@ Property / published in @@
+Lecture Notes in Computer Science
@@ Property / published in: Lecture Notes in Computer Science / rank @@
+Normal rank
@@ Property / publication date @@
+October 2017Timestamp +2017-10-23T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2017-10-23T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 23 October 2017 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6796719
@@ Property / zbMATH DE Number: 6796719 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3165702993
@@ Property / OpenAlex ID: W3165702993 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for maximum internal spanning tree
+Normal rank
@@ Property / cites work @@
+Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
+Normal rank
@@ Property / cites work @@
+A linear vertex kernel for maximum internal spanning tree
+Normal rank
@@ Property / cites work @@
+Sharp separation and applications to exact and parameterized algorithms
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees
+Normal rank
@@ Property / cites work @@
+A 2k-vertex Kernel for Maximum Internal Spanning Tree
+Normal rank
@@ Property / cites work @@
+A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs
+Normal rank
@@ Property / cites work @@
+Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover
+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 @@
+Approximating the maximum internal spanning tree problem
+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 / Wikidata QID @@
+Q128784974
@@ Property / Wikidata QID: Q128784974 / rank @@
+Normal rank