Approximating Scheduling Machines with Capacity Constraints (Q5321720): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1601005720
@@ Property / OpenAlex ID: W1601005720 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.3056
@@ Property / arXiv ID: 0906.3056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4796176
@@ Property / cites work: Q4796176 / rank @@
+Normal rank
@@ Property / cites work @@
+A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+A factor 2 approximation algorithm for the generalized Steiner network problem
+Normal rank
@@ Property / cites work @@
+Q3050157
@@ Property / cites work: Q3050157 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Approximating minimum bounded degree spanning trees to within one of optimal
+Normal rank
@@ Property / cites work @@
+Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling
+Normal rank
@@ Property / cites work @@
+A comment on scheduling two parallel machines with capacity constraints
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for scheduling two parallel machines with capacity constraints.
+Normal rank