Scheduling broadcasts with deadlines (Q1884847): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2004.02.047
+Normal rank
@@ Property / OpenAlex ID @@
+W1868304495
@@ Property / OpenAlex ID: W1868304495 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952666
@@ Property / cites work: Q4952666 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828963
@@ Property / cites work: Q4828963 / rank @@
+Normal rank
@@ Property / cites work @@
+NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
+Normal rank
@@ Property / cites work @@
+Online algorithms. The state of the art
@@ Property / cites work: Online algorithms. The state of the art / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737543
@@ Property / cites work: Q4737543 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2753944
@@ Property / cites work: Q2753944 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms - ESA 2003
@@ Property / cites work: Algorithms - ESA 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3128889
@@ Property / cites work: Q3128889 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2753958
@@ Property / cites work: Q2753958 / rank @@
+Normal rank
@@ Property / cites work @@
+On-line scheduling of jobs with fixed start and end times
+Normal rank