An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem (Q5505667): 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-540-85097-7_27
+Normal rank
@@ Property / OpenAlex ID @@
+W1556245316
@@ Property / OpenAlex ID: W1556245316 / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+Routing algorithm for multicast under multi-tree model in optical networks
+Normal rank
@@ Property / cites work @@
+Algorithms for multicast connection under multi-path routing model.
+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 @@
+An improved approximation algorithm for multicast \(k\)-tree routing
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for capacitated multicast routings in networks
+Normal rank
@@ Property / cites work @@
+Q4952699
@@ Property / cites work: Q4952699 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5505667