Improved approximation for fractionally subadditive network design (Q2011025): 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.ipl.2019.105861
+Normal rank
@@ Property / OpenAlex ID @@
+W2981213705
@@ Property / OpenAlex ID: W2981213705 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5111735
@@ Property / cites work: Q5111735 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for requirement cut
+Normal rank
@@ Property / cites work @@
+A tight bound on approximating arbitrary metrics by tree metrics
+Normal rank
@@ Property / cites work @@
+A factor 2 approximation algorithm for the generalized Steiner network problem
+Normal rank
@@ Property / cites work @@
+Expander graphs and their applications
@@ Property / cites work: Expander graphs and their applications / rank @@
+Normal rank