Minimal cost reconfiguration of data placement in a storage area network (Q690477): Difference between revisions

@@ Property / cites work @@
+Approximation algorithms for knapsack problems with cardinality constraints
+Normal rank
@@ Property / cites work @@
+Improved results for data migration and open shop scheduling
+Normal rank
@@ Property / cites work @@
+Q4952620
@@ Property / cites work: Q4952620 / rank @@
+Normal rank
@@ Property / cites work @@
+FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
+Normal rank
@@ Property / cites work @@
+Q4471279
@@ Property / cites work: Q4471279 / rank @@
+Normal rank
@@ Property / cites work @@
+Threshold-based dynamic replication in large-scale video-on-demand systems
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+On two class-constrained versions of the multiple knapsack problem
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for class-constrained packing problems
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Q3140449
@@ Property / cites work: Q3140449 / rank @@
+Normal rank