(Incremental) priority algorithms
From MaRDI portal
Publication:1762982
DOI10.1007/s00453-003-1036-3zbMath1082.68521OpenAlexW3136693265MaRDI QIDQ1762982
Allan Borodin, Morten Nyhave Nielsen, Charles W. Rackoff
Publication date: 11 February 2005
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-003-1036-3
Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (29)
Mechanisms for (mis)allocating scientific credit ⋮ Models of greedy algorithms for graph problems ⋮ An Optimal Control Framework for Online Job Scheduling with General Cost Functions ⋮ On the Structure of Optimal Greedy Computation (for Job Scheduling) ⋮ Two-way greedy: algorithms for imperfect rationality ⋮ Greedy Matching in Bipartite Random Graphs ⋮ Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems ⋮ Advice complexity of adaptive priority algorithms ⋮ Erratum to: ``Greedy matching: guarantees and limitations ⋮ Toward a model for backtracking and dynamic programming ⋮ On extensions of the deterministic online model for bipartite matching and max-sat ⋮ Hybrid Bellman-Ford-Dijkstra algorithm ⋮ Greedy matching: guarantees and limitations ⋮ Limitations of incremental dynamic programming ⋮ Combinatorial auctions without money ⋮ On exponential time lower bound of Knapsack under backtracking ⋮ Characterizing sets of jobs that admit optimal greedy-like algorithms ⋮ A stronger model of dynamic programming algorithms ⋮ Randomized priority algorithms ⋮ On conceptually simple algorithms for variants of online bipartite matching ⋮ Advice complexity of priority algorithms ⋮ A PAC Approach to Application-Specific Algorithm Selection ⋮ Decentralized utilitarian mechanisms for scheduling games ⋮ Stochastic dominance and the bijective ratio of online algorithms ⋮ Priority algorithms for the subset-sum problem ⋮ On sum coloring and sum multi-coloring for restricted families of graphs ⋮ Priority algorithms for graph optimization problems ⋮ Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds ⋮ The Power of Oblivious Wireless Power
This page was built for publication: (Incremental) priority algorithms
