On the Structure of Optimal Greedy Computation (for Job Scheduling) (Q3182959): Difference between revisions

@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411275
@@ Property / cites work: Q4411275 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+(Incremental) priority algorithms
@@ Property / cites work: (Incremental) priority algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Matroids and the greedy algorithm
@@ Property / cites work: Matroids and the greedy algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+An Exact Characterization of Greedy Structures
@@ Property / cites work: An Exact Characterization of Greedy Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Hierarchies for classes of priority algorithms for job scheduling
+Normal rank
@@ Property / cites work @@
+Characterizing sets of jobs that admit optimal greedy-like algorithms
+Normal rank
@@ Property / cites work @@
+Priority algorithms for makespan minimization in the subset model.
+Normal rank