A note on graph balancing problems with restrictions (Q990093): Difference between revisions

@@ Property / cites work @@
+GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
+Normal rank
@@ Property / cites work @@
+Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579372
@@ Property / cites work: Q3579372 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling with job assignment restrictions
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling under a grade of service provision
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling of machine-dependent jobs with unit-length.
+Normal rank
@@ Property / cites work @@
+Scheduling parallel machines with inclusive processing set restrictions
+Normal rank
@@ Property / cites work @@
+Q3525911
@@ Property / cites work: Q3525911 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation algorithms for machine scheduling: Ten open problems
+Normal rank
@@ Property / cites work @@
+An optimal rounding gives a better approximation for scheduling unrelated machines
+Normal rank