Parallel approximation algorithms for bin packing (Q1123807): 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.1016/0890-5401(89)90003-5
+Normal rank
@@ Property / OpenAlex ID @@
+W1988727224
@@ Property / OpenAlex ID: W1988727224 / rank @@
+Normal rank
@@ Property / cites work @@
+A new proof for the first-fit decreasing bin-packing algorithm
+Normal rank
@@ Property / cites work @@
+Optimal parallel generation of a computation tree form
+Normal rank
@@ Property / cites work @@
+Linear programming is log-space hard for P
@@ Property / cites work: Linear programming is log-space hard for P / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing can be solved within 1+epsilon in linear time
+Normal rank
@@ Property / cites work @@
+Parallelism in random access machines
@@ Property / cites work: Parallelism in random access machines / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum flow problem is log space complete for P
+Normal rank
@@ Property / cites work @@
+Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
+Normal rank
@@ Property / cites work @@
+Parallel Prefix Computation
@@ Property / cites work: Parallel Prefix Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Processing with the Perfect Shuffle
@@ Property / cites work: Parallel Processing with the Perfect Shuffle / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1123807