(\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation (Q386436): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-012-9454-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2031024903
@@ Property / OpenAlex ID: W2031024903 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252268
@@ Property / cites work: Q4252268 / rank @@
+Normal rank
@@ Property / cites work @@
+Online Tree Node Assignment with Resource Augmentation
+Normal rank
@@ Property / cites work @@
+A constant-competitive algorithm for online OVSF code assignment
+Normal rank
@@ Property / cites work @@
+Online OVSF Code Assignment with Resource Augmentation
+Normal rank
@@ Property / cites work @@
+Online bin packing with resource augmentation
@@ Property / cites work: Online bin packing with resource augmentation / rank @@
+Normal rank
@@ Property / cites work @@
+STACS 2004
@@ Property / cites work: STACS 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Online Bandwidth Allocation
@@ Property / cites work: Online Bandwidth Allocation / rank @@
+Normal rank
@@ Property / cites work @@
+Speed is as powerful as clairvoyance
@@ Property / cites work: Speed is as powerful as clairvoyance / rank @@
+Normal rank
@@ Property / cites work @@
+Improving the competitive ratio of the online OVSF code assignment problem
+Normal rank
@@ Property / cites work @@
+Optimal time-critical scheduling via resource augmentation
+Normal rank