Approximating Directed Weighted-Degree Constrained Networks (Q3541798): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-85363-3_18
+Normal rank
@@ Property / OpenAlex ID @@
+W1830269881
@@ Property / OpenAlex ID: W1830269881 / rank @@
+Normal rank
@@ Property / cites work @@
+Small degree out‐branchings
@@ Property / cites work: Small degree out‐branchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q5302102
@@ Property / cites work: Q5302102 / rank @@
+Normal rank
@@ Property / cites work @@
+A Push-Relabel Algorithm for Approximating Degree Bounded MSTs
+Normal rank
@@ Property / cites work @@
+Q4871749
@@ Property / cites work: Q4871749 / rank @@
+Normal rank
@@ Property / cites work @@
+Network Design with Weighted Degree Constraints
@@ Property / cites work: Network Design with Weighted Degree Constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Minimum-Degree Steiner Tree to within One of Optimal
+Normal rank
@@ Property / cites work @@
+A factor 2 approximation algorithm for the generalized Steiner network problem
+Normal rank
@@ Property / cites work @@
+A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+Survivable network design with degree or order constraints
+Normal rank
@@ Property / cites work @@
+Algorithms for a network design problem with crossing supermodular demands
+Normal rank
@@ Property / cites work @@
+Many birds with one stone
@@ Property / cites work: Many birds with one stone / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
+Normal rank
@@ Property / cites work @@
+Approximating minimum bounded degree spanning trees to within one of optimal
+Normal rank