Advice complexity of priority algorithms (Q5916086): Difference between revisions

@@ Property / cites work @@
+Toward a model for backtracking and dynamic programming
+Normal rank
@@ Property / cites work @@
+The power of priority algorithms for facility location and set cover
+Normal rank
@@ Property / cites work @@
+Greedy matching: guarantees and limitations
@@ Property / cites work: Greedy matching: guarantees and limitations / rank @@
+Normal rank
@@ Property / cites work @@
+The string guessing problem as a method to prove lower bounds on the advice complexity
+Normal rank
@@ Property / cites work @@
+On the Advice Complexity of the k-Server Problem
@@ Property / cites work: On the Advice Complexity of the k-Server Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Online algorithms with advice: the tape model
@@ Property / cites work: Online algorithms with advice: the tape model / rank @@
+Normal rank
@@ Property / cites work @@
+Priority algorithms for graph optimization problems
+Normal rank
@@ Property / cites work @@
+Advice complexity of priority algorithms
@@ Property / cites work: Advice complexity of priority algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+(Incremental) priority algorithms
@@ Property / cites work: (Incremental) priority algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Online bin packing with advice
@@ Property / cites work: Online bin packing with advice / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Models of greedy algorithms for graph problems
@@ Property / cites work: Models of greedy algorithms for graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4606307
@@ Property / cites work: Q4606307 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Bubblesearch: a simple heuristic for improving priority-based greedy algorithms
+Normal rank
@@ Property / cites work @@
+The approximation of maximum subgraph problems
@@ Property / cites work: The approximation of maximum subgraph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Randomization Can Be as Helpful as a Glimpse of the Future in Online Computation
+Normal rank
@@ Property / cites work @@
+On extensions of the deterministic online model for bipartite matching and max-sat
+Normal rank
@@ Property / cites work @@
+Bounds on Greedy Algorithms for MAX SAT
@@ Property / cites work: Bounds on Greedy Algorithms for MAX SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
+Normal rank
@@ Property / cites work @@
+Priority algorithms for makespan minimization in the subset model.
+Normal rank