Approximation algorithms for some optimum communication spanning tree problems (Q1566575): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimum Communication Spanning Trees
@@ Property / cites work: Optimum Communication Spanning Trees / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the network design problem
@@ Property / cites work: The complexity of the network design problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3707420
@@ Property / cites work: Q3707420 / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-Case Analysis of Network Design Problem Heuristics
+Normal rank
@@ Property / cites work @@
+Q4250159
@@ Property / cites work: Q4250159 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0166-218x(99)00212-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2030879379
@@ Property / OpenAlex ID: W2030879379 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1566575