Abstract Borodin et al.(Algorithmica 37 (4): 295–326, 2003) gave a model of greedy-like
algorithms for scheduling problems and Angelopoulos and Borodin (Algorithmica 40 (4) …

We propose a model called priority branching trees (pBT) for backtracking and dynamic
programming algorithms. Our model generalizes both the priority model of Borodin, Nielson …

We study the question of which optimization problems can be optimally or approximately
solved by “greedy” or “greedy-like” algorithms. For definiteness, we limit the present …

We introduce BubbleSearch, a general approach for extending priority-based greedy
heuristics. Following the framework recently developed by Borodin et al., we consider …

We continue the study of priority or “greedy-like” algorithms as initiated in Borodin et
al.(2003)[10] and as extended to graph theoretic problems in Davis and Impagliazzo …

We present a series of results regarding conceptually simple algorithms for bipartite
matching in various online and related models. We first consider a deterministic adversarial …

We continue the study of priority or “greedy-like” algorithms as initiated in [6] and as
extended to graph theoretic problems in [9]. Graph theoretic problems pose some modelling …

A rising number of multimedia applications with Quality of Service requirements is delivered
via cloud computing platforms. To reduce latencies between data centers and customers …

In a paper of Borodin, Nielsen and Rackoff [8], a framework for abstracting the properties of
deterministic greedy-like algorithms was proposed. We extend their model so as to formally …

Priority algorithm is a model of computation capturing the notion of greedy and greedy-like
algorithm. This paper concerns priority algorithms for Job Scheduling. Three main …