Online minimization of the maximum starting time: migration helps (Q6174813): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-023-01097-0
+Normal rank
@@ Property / OpenAlex ID @@
+W4318069711
@@ Property / OpenAlex ID: W4318069711 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust online algorithms for certain dynamic packing problems
+Normal rank
@@ Property / cites work @@
+Online Bin Covering with Limited Migration
@@ Property / cites work: Online Bin Covering with Limited Migration / rank @@
+Normal rank
@@ Property / cites work @@
+Fully dynamic bin packing revisited
@@ Property / cites work: Fully dynamic bin packing revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Sensitivity theorems in integer linear programming
+Normal rank
@@ Property / cites work @@
+Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
+Normal rank
@@ Property / cites work @@
+A robust APTAS for the classical bin packing problem
+Normal rank
@@ Property / cites work @@
+Robust Approximation Schemes for Cube Packing
@@ Property / cites work: Robust Approximation Schemes for Cube Packing / rank @@
+Normal rank
@@ Property / cites work @@
+Robust algorithms for preemptive scheduling
@@ Property / cites work: Robust algorithms for preemptive scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Robust algorithms for total completion time
@@ Property / cites work: Robust algorithms for total completion time / rank @@
+Normal rank
@@ Property / cites work @@
+Starting time minimization for the maximum job variant
+Normal rank
@@ Property / cites work @@
+Approximation schemes for the min-max starting time problem
+Normal rank
@@ Property / cites work @@
+Minimizing the maximum starting time on-line
@@ Property / cites work: Minimizing the maximum starting time on-line / rank @@
+Normal rank
@@ Property / cites work @@
+Fully-Dynamic Bin Packing with Little Repacking
@@ Property / cites work: Fully-Dynamic Bin Packing with Little Repacking / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetry Exploitation for Online Machine Covering with Bounded Migration
+Normal rank
@@ Property / cites work @@
+A Robust AFPTAS for Online Bin Packing with Polynomial Migration
+Normal rank
@@ Property / cites work @@
+Q5002616
@@ Property / cites work: Q5002616 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming with a Fixed Number of Variables
+Normal rank
@@ Property / cites work @@
+A note on an open-end bin packing problem
@@ Property / cites work: A note on an open-end bin packing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Online Single Machine Scheduling to Minimize the Maximum Starting Time
+Normal rank
@@ Property / cites work @@
+Online Scheduling with Bounded Migration
@@ Property / cites work: Online Scheduling with Bounded Migration / rank @@
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
+Normal rank
@@ Property / cites work @@
+Parameterized on-line open-end bin packing
@@ Property / cites work: Parameterized on-line open-end bin packing / rank @@
+Normal rank