Improved approximation algorithms for the single-sink buy-at-bulk network design problems (Q1026237): 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.1016/j.jda.2008.12.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2022174455
@@ Property / OpenAlex ID: W2022174455 / rank @@
+Normal rank
@@ Property / cites work @@
+A tight bound on approximating arbitrary metrics by tree metrics
+Normal rank
@@ Property / cites work @@
+Improved Approximation for Single-Sink Buy-at-Bulk
+Normal rank
@@ Property / cites work @@
+Q4537744
@@ Property / cites work: Q4537744 / rank @@
+Normal rank
@@ Property / cites work @@
+A constant factor approximation for the single sink edge installation problems
+Normal rank
@@ Property / cites work @@
+Simpler and better approximation algorithms for network design
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+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 @@
+Q4952699
@@ Property / cites work: Q4952699 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Single-Sink Link-Installation Problem in Network Design
+Normal rank
@@ Property / cites work @@
+Q4737546
@@ Property / cites work: Q4737546 / rank @@
+Normal rank