Sciweavers

TCS
2010
13 years 5 months ago
Randomized priority algorithms
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
Spyros Angelopoulos, Allan Borodin
IPL
2006
80views more  IPL 2006»
13 years 6 months ago
BubbleSearch: A simple heuristic for improving priority-based greedy algorithms
We introduce BubbleSearch, a general approach for extending priority-based greedy heuristics. Following the framework recently developed by Borodin et al., we consider priority al...
Neal Lesh, Michael Mitzenmacher
COCOON
2007
Springer
14 years 1 months ago
Priority Algorithms for the Subset-Sum Problem
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
Yuli Ye, Allan Borodin
MFCS
2009
Springer
14 years 1 months ago
On the Structure of Optimal Greedy Computation (for Job Scheduling)
We consider Priority Algorithm [BNR03] as a syntactic model of formulating the concept of greedy algorithm for Job Scheduling, and we study the computation of optimal priority alg...
Periklis A. Papakonstantinou