On-line Scheduling with a Monotonous Subsequence Constraint (Q4632214): Difference between revisions

@@ Property / cites work @@
+On computing the length of longest increasing subsequences
+Normal rank
@@ Property / cites work @@
+An algorithm for solving the longest increasing circular subsequence problem
+Normal rank
@@ Property / cites work @@
+The Surprising Mathematics of Longest Increasing Subsequences
+Normal rank
@@ Property / cites work @@
+Longest increasing subsequences in sliding windows
+Normal rank
@@ Property / cites work @@
+Optimal online selection of a monotone subsequence: a central limit theorem
+Normal rank
@@ Property / cites work @@
+Tight Bounds for Permutation Flow Shop Scheduling
@@ Property / cites work: Tight Bounds for Permutation Flow Shop Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive analysis of preemptive single-machine scheduling
+Normal rank
@@ Property / cites work @@
+A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
+Normal rank
@@ Property / cites work @@
+On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank