Spanning trees with minimum weighted degrees (Q2380008): Difference between revisions

@@ Property / cites work @@
+Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs
+Normal rank
@@ Property / cites work @@
+The Bounded Path Tree Problem
@@ Property / cites work: The Bounded Path Tree Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of spanning tree problems: Part I
@@ Property / cites work: Complexity of spanning tree problems: Part I / rank @@
+Normal rank
@@ Property / cites work @@
+A Push-Relabel Algorithm for Approximating Degree Bounded MSTs
+Normal rank
@@ Property / cites work @@
+On the complexity of finding multi-constrained spanning trees
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Q4763417
@@ Property / cites work: Q4763417 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for finding low-degree subgraphs
+Normal rank
@@ Property / cites work @@
+A matter of degree
@@ Property / cites work: A matter of degree / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of restricted spanning tree problems
+Normal rank
@@ Property / cites work @@
+Many birds with one stone
@@ Property / cites work: Many birds with one stone / rank @@
+Normal rank