A constant factor approximation algorithm for the storage allocation problem (Q524369): Difference between revisions

@@ Property / cites work @@
+Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path
+Normal rank
@@ Property / cites work @@
+A Mazing 2+<i>∊</i> Approximation for Unsplittable Flow on a Path
+Normal rank
@@ Property / cites work @@
+A quasi-PTAS for unsplittable flow on line graphs
@@ Property / cites work: A quasi-PTAS for unsplittable flow on line graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A logarithmic approximation for unsplittable flow on line graphs
+Normal rank
@@ Property / cites work @@
+A unified approach to approximating resource allocation and scheduling
+Normal rank
@@ Property / cites work @@
+Resource allocation in bounded degree trees
@@ Property / cites work: Resource allocation in bounded degree trees / rank @@
+Normal rank
@@ Property / cites work @@
+A constant factor approximation algorithm for the storage allocation problem
+Normal rank
@@ Property / cites work @@
+Q3337223
@@ Property / cites work: Q3337223 / rank @@
+Normal rank
@@ Property / cites work @@
+New Approximation Schemes for Unsplittable Flow on a Path
+Normal rank
@@ Property / cites work @@
+A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths
+Normal rank
@@ Property / cites work @@
+Q2934699
@@ Property / cites work: Q2934699 / rank @@
+Normal rank
@@ Property / cites work @@
+<i>OPT</i>Versus<i>LOAD</i>in Dynamic Storage Allocation
+Normal rank
@@ Property / cites work @@
+Q4737541
@@ Property / cites work: Q4737541 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the unsplittable flow problem
+Normal rank
@@ Property / cites work @@
+Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
+Normal rank
@@ Property / cites work @@
+Multicommodity demand flow in a tree and packing integer programs
+Normal rank
@@ Property / cites work @@
+Caching is hard -- even in the fault model
@@ Property / cites work: Caching is hard -- even in the fault model / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of path coloring and call scheduling
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
+Normal rank
@@ Property / cites work @@
+On Linear Programming Relaxations for Unsplittable Flow in Trees
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252403
@@ Property / cites work: Q4252403 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4472463
@@ Property / cites work: Q4472463 / rank @@
+Normal rank
@@ Property / cites work @@
+Smallest-last ordering and clustering and graph coloring algorithms
+Normal rank
@@ Property / cites work @@
+A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem
+Normal rank