The \((K, k)\)-capacitated spanning tree problem (Q1926491): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2012.08.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2080907650
@@ Property / OpenAlex ID: W2080907650 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the capacitated tree problem
@@ Property / cites work: The complexity of the capacitated tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Topological design of telecommunication networks --- local access design methods
+Normal rank
@@ Property / cites work @@
+The Multilevel Capacitated Minimum Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Heuristics with Constant Error Guarantees for the Design of Tree Networks
+Normal rank
@@ Property / cites work @@
+Analysis of heuristics for the design of tree networks
+Normal rank
@@ Property / cites work @@
+Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
+Normal rank
@@ Property / cites work @@
+Survivable network design: the capacitated minimum spanning network problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
+Normal rank
@@ Property / cites work @@
+Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds
+Normal rank
@@ Property / cites work @@
+Approximating minimum bounded degree spanning trees to within one of optimal
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for capacitated multicast routings in networks
+Normal rank
@@ Property / cites work @@
+Q4363166
@@ Property / cites work: Q4363166 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4869540
@@ Property / cites work: Q4869540 / rank @@
+Normal rank