Approximation algorithms for time-constrained scheduling on line networks (Q693767): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00224-011-9351-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2063934256
@@ Property / OpenAlex ID: W2063934256 / rank @@
+Normal rank
@@ Property / cites work @@
+Time-constrained scheduling of weighted packets on trees and meshes
+Normal rank
@@ Property / cites work @@
+Scheduling time-constrained communication in linear networks
+Normal rank
@@ Property / cites work @@
+Q4471371
@@ Property / cites work: Q4471371 / rank @@
+Normal rank
@@ Property / cites work @@
+The network as a storage device: dynamic routing with bounded buffers
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive weighted throughput analysis of greedy protocols on DAGs
+Normal rank
@@ Property / cites work @@
+Probability Inequalities for Sums of Bounded Random Variables
+Normal rank
@@ Property / cites work @@
+An overtraining-resistant stochastic modeling method for pattern recognition
+Normal rank
@@ Property / cites work @@
+Approximations for the disjoint paths problem in high-diameter planar networks
+Normal rank
@@ Property / cites work @@
+Online time-constrained scheduling in linear and ring networks
+Normal rank
@@ Property / cites work @@
+Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
+Normal rank
@@ Property / cites work @@
+Randomized rounding: A technique for provably good algorithms and algorithmic proofs
+Normal rank