Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Scheduling jobs with fixed start and end times
Discrete Applied Mathematics
Introduction to algorithms
Algorithms from P to NP (vol. 1): design and efficiency
Algorithms from P to NP (vol. 1): design and efficiency
On-line scheduling in the presence of overload
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
MOCA: a multiprocessor on-line competitive algorithm for real-time system scheduling
Theoretical Computer Science - Special issue on dependable parallel computing
The competitiveness of on-line assignments
Journal of Algorithms
2nd Twente workshop on Graphs and combinatorial optimization
2nd Twente workshop on Graphs and combinatorial optimization
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Incremental clustering and dynamic information retrieval
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximating the throughput of multiple machines under real-time scheduling
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On-line randomized call control revisited
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for Scheduling Independent Tasks
Journal of the ACM (JACM)
On the k-Coloring of Intervals
ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
Developments from a June 1996 seminar on Online algorithms: the state of the art
Semi-online scheduling with decreasing job sizes
Operations Research Letters
Priority algorithms for makespan minimization in the subset model
Information Processing Letters
On the Power of Priority Algorithms for Facility Location and Set Cover
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Models of greedy algorithms for graph problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
BubbleSearch: a simple heuristic for improving priority-based greedy algorithms
Information Processing Letters
Hierarchies for classes of priority algorithms for job scheduling
Theoretical Computer Science
(Almost) optimal coordination mechanisms for unrelated machine scheduling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
BubbleSearch: A simple heuristic for improving priority-based greedy algorithms
Information Processing Letters
Price of anarchy for greedy auctions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On the limitations of Greedy mechanism design for truthful combinatorial auctions
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Inner product spaces for MinSum coordination mechanisms
Proceedings of the forty-third annual ACM symposium on Theory of computing
How well can primal-dual and local-ratio algorithms perform?
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Towards a theory of algorithms
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
We study the question of what optimization problems can be optimally or approximately solved by "greedy-like" algorithms. For definiteness, we will limit the present discussion to some well-studied scheduling problems although the underlying issues apply in a much more general setting. Of course, the main benefit of greedy algorithms lies in both their conceptual simplicity and their computational efficiency. Based on the experience from online competitive analysis, it seems plausible that we should be able to derive approximation bounds for "greedy-like" algorithms exploiting only the conceptual simplicity of these algorithms. To this end, we will provide a precise definition of what we mean by greedy and greedy-like. A full version of this paper is available at http://www.cs.toronto.edu/~ bor/priority.ps.