Erratum to ``Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks'' (Q447565): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+M20
@@ Property / Mathematics Subject Classification ID: 68M20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C60
@@ Property / Mathematics Subject Classification ID: 90C60 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6076658
@@ Property / zbMATH DE Number: 6076658 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q58698841
@@ Property / Wikidata QID: Q58698841 / rank @@
+Normal rank
@@ 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.1155/2012/543215
+Normal rank
@@ Property / OpenAlex ID @@
+W4206342720
@@ Property / OpenAlex ID: W4206342720 / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks
+Normal rank
@@ Property / cites work @@
+UET scheduling with unit interprocessor communication delays
+Normal rank
@@ Property / cites work @@
+Scheduling \(UET\)-tasks on a star network: complexity and approximation
+Normal rank
@@ Property / DBLP publication ID @@
+journals/advor/BouznifG12
@@ Property / DBLP publication ID: journals/advor/BouznifG12 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:447565