The following pages link to (Incremental) priority algorithms (Q1762982):
Displaying 42 items.
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- Hybrid Bellman-Ford-Dijkstra algorithm (Q511150) (← links)
- Greedy matching: guarantees and limitations (Q513303) (← links)
- Limitations of incremental dynamic programming (Q517805) (← links)
- Combinatorial auctions without money (Q521808) (← links)
- A stronger model of dynamic programming algorithms (Q547305) (← links)
- On sum coloring and sum multi-coloring for restricted families of graphs (Q764335) (← links)
- Hierarchies for classes of priority algorithms for job scheduling (Q818127) (← links)
- Mechanisms for (mis)allocating scientific credit (Q832517) (← links)
- Models of greedy algorithms for graph problems (Q834580) (← links)
- On exponential time lower bound of Knapsack under backtracking (Q964408) (← links)
- Characterizing sets of jobs that admit optimal greedy-like algorithms (Q964871) (← links)
- Randomized priority algorithms (Q974749) (← links)
- Priority algorithms for the subset-sum problem (Q1029701) (← links)
- Priority algorithms for graph optimization problems (Q1041242) (← links)
- Bubblesearch: a simple heuristic for improving priority-based greedy algorithms (Q1045924) (← links)
- Erratum to: ``Greedy matching: guarantees and limitations'' (Q1702135) (← links)
- On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)
- Combinatorial optimization algorithms combining greedy strategies with a limited search procedure (Q1745806) (← links)
- Priority algorithms for makespan minimization in the subset model. (Q1853127) (← links)
- The classification of greedy algorithms (Q1887176) (← links)
- Two-way greedy: algorithms for imperfect rationality (Q2152097) (← links)
- Stochastic dominance and the bijective ratio of online algorithms (Q2309465) (← links)
- Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems (Q2428688) (← links)
- Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
- On the Structure of Optimal Greedy Computation (for Job Scheduling) (Q3182959) (← links)
- Improving Greedy Algorithms by Lookahead-Search (Q4289838) (← links)
- Fishspear: a priority queue algorithm (Q4299294) (← links)
- (Q4720762) (← links)
- An Optimal Control Framework for Online Job Scheduling with General Cost Functions (Q5058033) (← links)
- Greedy Matching in Bipartite Random Graphs (Q5084502) (← links)
- A PAC Approach to Application-Specific Algorithm Selection (Q5269823) (← links)
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds (Q5269825) (← links)
- The Power of Oblivious Wireless Power (Q5269826) (← links)
- Approximation and Online Algorithms (Q5713429) (← links)
- Approximation and Online Algorithms (Q5713437) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
- Advice complexity of priority algorithms (Q5916086) (← links)
- Advice complexity of adaptive priority algorithms (Q6180750) (← links)
- Optimizing over serial dictatorships (Q6546303) (← links)
- Optimizing over serial dictatorships (Q6635694) (← links)
- Priority algorithms with advice for disjoint path allocation problems (Q6639746) (← links)
