Q5092381 (Q5092381): Difference between revisions

@@ Property / cites work @@
+Dynamic Facility Location via Exponential Clocks
@@ Property / cites work: Dynamic Facility Location via Exponential Clocks / rank @@
+Normal rank
@@ Property / cites work @@
+Integer programming and combinatorial optimization. 12th international IPCO conference, Ithaca, NY, USA, June 25--27, 2007. Proceedings.
+Normal rank
@@ Property / cites work @@
+Q5116470
@@ Property / cites work: Q5116470 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Sum-Radii Clustering
@@ Property / cites work: Dynamic Sum-Radii Clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive Analysis via Regularization
@@ Property / cites work: Competitive Analysis via Regularization / rank @@
+Normal rank
@@ Property / cites work @@
+Unified Algorithms for Online Learning and Competitive Analysis
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for knapsack problems with cardinality constraints
+Normal rank
@@ Property / cites work @@
+On the Tradeoff between Stability and Fit
@@ Property / cites work: On the Tradeoff between Stability and Fit / rank @@
+Normal rank
@@ Property / cites work @@
+Facility Location in Evolving Metrics
@@ Property / cites work: Facility Location in Evolving Metrics / rank @@
+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 @@
+The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online
+Normal rank
@@ Property / cites work @@
+Changing Bases: Multistage Optimization for Matroids and Matchings
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+A new fully polynomial time approximation scheme for the Knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3320130
@@ Property / cites work: Q3320130 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Knapsack Problems
+Normal rank
@@ Property / cites work @@
+A fully polynomial approximation algorithm for the 0-1 knapsack problem
+Normal rank
@@ Property / cites work @@
+The Power of Recourse for Online MST and TSP
@@ Property / cites work: The Power of Recourse for Online MST and TSP / rank @@
+Normal rank
@@ Property / cites work @@
+Offline and online facility leasing
@@ Property / cites work: Offline and online facility leasing / rank @@
+Normal rank
@@ Property / cites work @@
+The min-up/min-down unit commitment polytope
@@ Property / cites work: The min-up/min-down unit commitment polytope / rank @@
+Normal rank
@@ Property / cites work @@
+A theory and algorithms for combinatorial reoptimization
+Normal rank